A Truthful and Low-Overhead Routing Protocol for Ad Hoc Networks

Nodes in wireless ad hoc networks depend on others for forwarding packets hop by hop. However, nodes may behave selfishly and do not forward packets for saving their limited resources. Approaches based on Vickrey, Clarke and Groves (VCG) pay to the intermediate nodes a premium over their actual costs to stimulate cooperation for their forwarding services and are truthful routing protocols in which nodes can maximize their utility only when the nodes declare truthful cost for forwarding packets. But the route overhead of the existing routing protocols based on VCG is at least O(n 2 ) which is likely to become prohibitively large as the network size grows and leads to serious traffic congestion and packet dropping. In response to the problems, we proposed a truthful and low-overhead routing protocol (TLOR) based on VCG for ad hoc networks with selfish nodes which can achieve cost-efficient routing and truthfulness. TLOR incur the route with overhead of O(Ln), where L is an upper bound on the hop number of the path and n is the number of nodes in network. Analysis and simulation results verify that TLOR is truthful and can significantly reduce the route overhead.

[1]  E. M. Babb,et al.  Pricing public goods , 1975 .

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

[3]  Acm Sigmobile,et al.  Proceedings of the 26th Annual International Conference on Mobile Computing and Networking , 1995 .

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

[5]  K. J. Ray Liu,et al.  Securing Cooperative Ad-Hoc Networks Under Noise and Imperfect Monitoring: Strategies and Game Theoretic Analysis , 2007, IEEE Transactions on Information Forensics and Security.

[6]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[7]  K. J. Ray Liu,et al.  Secure Cooperation in Autonomous Mobile Ad-Hoc Networks Under Noise and Imperfect Monitoring: A Game-Theoretic Approach , 2008, IEEE Transactions on Information Forensics and Security.

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

[9]  Girish Katkar,et al.  Mobile ad hoc networking: imperatives and challenges , 2003, Ad Hoc Networks.

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

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

[12]  Mukesh Singhal,et al.  On improving the efficiency of truthful routing in MANETs with selfish nodes , 2007, Pervasive Mob. Comput..

[13]  Shi Jin,et al.  Repeated-Game Modeling of Cooperation Enforcement in Wireless Ad Hoc Network , 2008 .

[14]  Timothy X. Brown,et al.  An on-demand minimum energy routing protocol for a wireless ad hoc network , 2002, MOCO.

[15]  Yacine Rebahi,et al.  A reputation-based trust mechanism for ad hoc networks , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

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

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

[18]  Ali Movaghar,et al.  A distributed truthful routing protocol for Mobile Ad hoc Networks , 2010, 2010 International Conference on Computer and Information Application.

[19]  Daniele Quercia,et al.  STRUDEL: supporting trust in the dynamic establishment of peering coalitions , 2006, SAC '06.

[20]  Paolo Santi,et al.  The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes , 2008, IEEE Transactions on Mobile Computing.

[21]  E. H. Clarke Multipart pricing of public goods , 1971 .

[22]  Theodore Groves,et al.  Incentives in Teams , 1973 .

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

[24]  Haiying Shen,et al.  ARM: An Account-Based Hierarchical Reputation Management System for Wireless Ad Hoc Networks , 2008, 2008 The 28th International Conference on Distributed Computing Systems Workshops.

[25]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .