Design of an Optimal Bayesian Incentive Compatible Broadcast Protocol for Ad Hoc Networks with Rational Nodes

Nodes in an ad hoc wireless network incur certain costs for forwarding packets since packet forwarding consumes the resources of the nodes. If the nodes are rational, free packet forwarding by the nodes cannot be taken for granted and incentive based protocols are required to stimulate cooperation among the nodes. Existing incentive based approaches are based on the VCG (Vickrey-Clarke-Groves) mechanism which leads to high levels of incentive budgets and restricted applicability to only certain topologies of networks. Moreover, the existing approaches have only focused on unicast and multicast. Motivated by this, we propose an incentive based broadcast protocol that satisfies Bayesian incentive compatibility and minimizes the incentive budgets required by the individual nodes. The proposed protocol, which we call BIC-B (Bayesian incentive compatible broadcast) protocol, also satisfies budget balance. We also derive a necessary and sufficient condition for the ex-post individual rationality of the BIC-B protocol. The BIC-B protocol exhibits superior performance in comparison to a dominant strategy incentive compatible broadcast protocol.

[1]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Paul Resnick,et al.  Reputation systems , 2000, CACM.

[3]  Eitan Altman,et al.  Non-cooperative Forwarding in Ad-Hoc Networks , 2005, NETWORKING.

[4]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[5]  Xiang-Yang Li,et al.  Low-cost truthful multicast in selfish and rational wireless ad hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[6]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[7]  Silvia Giordano,et al.  Modelling cooperation in mobile ad hoc networks: a formal description of selfishness , 2003 .

[8]  Brahim Bensaou,et al.  Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks , 2004, IEEE INFOCOM 2004.

[9]  Y. Narahari,et al.  Foundations of Mechanism Design , 2009 .

[10]  Paul Resnick,et al.  Reputation Systems: Facilitating Trust in Internet Interactions , 2000 .

[11]  N. Rama Suri Design of Incentive Compatible Protocols for Wireless Networks: A Game Theoretic Approach , 2006 .

[12]  Xiang-Yang Li,et al.  Truthful low-cost unicast in selfish wireless networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[13]  Paolo Santi,et al.  COMMIT: a sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[14]  Levente Buttyán,et al.  Nash equilibria of packet forwarding strategies in wireless ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

[15]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[16]  Zhisheng Niu,et al.  A Game-Theoretical Power and Rate Control for Wireless Ad Hoc Networks with Step-up Price , 2005, IEICE Trans. Commun..

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

[18]  Dinesh Garg Design Of Innovative Mechanisms For Contemporary Game Theoretic Problems In Electronic Commerce , 2006 .

[19]  Sujit Gujar,et al.  Foundations of mechanism design: A tutorial Part 1-Key concepts and classical results , 2008 .

[20]  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).

[21]  P. Maille,et al.  Why VCG auctions can hardly be applied to the pricing of inter-domain and ad hoc networks , 2007, 2007 Next Generation Internet Networks.

[22]  Ramasuri Narayanam,et al.  Design Of Incentive Compatible Broadcast Protocols For Ad hoc Wireless Networks : A Game Theoretic Approach , 2006 .

[23]  Cem U. Saraydar,et al.  Efficient power control via pricing in wireless data networks , 2002, IEEE Trans. Commun..

[24]  Udo W. Pooch,et al.  A game theoretic framework for bandwidth reservation in mobile ad hoc networks , 2004, First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks.

[25]  Nitin H. Vaidya,et al.  Selfish MAC layer misbehavior in wireless networks , 2005, IEEE Transactions on Mobile Computing.

[26]  Y. Narahari,et al.  Broadcast in Ad hoc Wireless Networks with Selfish Nodes: A Bayesian Incentive Compatibility Approach , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[27]  Tim Hawkins,et al.  Towards A Game Theoretic Understanding of Ad-Hoc Routing , 2005, GDV@CAV.

[28]  Subhash Suri,et al.  Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[29]  Yu Wang,et al.  Truthful Multicast in Selfish Wireless Networks , 2004 .

[30]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

[31]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks , 2006, Wirel. Networks.

[32]  Petteri Nurmi,et al.  Modelling routing in wireless ad hoc networks with dynamic Bayesian games , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[33]  V. Georgiev Using Game Theory to Analyze Wireless Ad Hoc Networks . ” , 2008 .

[34]  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.

[35]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques , 2005, MobiCom '05.

[36]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.