A Truthful Geographic Forwarding Algorithm for Ad-hoc Networks with Selfish Nodes

Geographic routing algorithms for ad-hoc networks exhibit better scalability compared to topology-based routing algorithms. However, geographic routing algorithms assume a cooperative network setting for ad-hoc networks. In this paper, we present TGF, a truthful geographic forwarding algorithm for ad-hoc networks that consist of selfish nodes. These selfish nodes forward data packets from other nodes, if they get enough payment to cover their individual forwarding cost. TGF stimulates node cooperation by using the concept of virtual money and prevents nodes from cheating over their cost. We introduce three auction schemes for forwarding packets to a next hop. In all schemes the next hop node is typically the winner of the auction. We show that TGF is a truthful geographic forwarding algorithm an algorithm is truthful if it maximizes the utility of nodes only when they bid or claim their true cost. Furthermore, we show the effectiveness of TGF via extensive simulations under various network scenarios. To the best of our knowledge, TGF is the first truthful geographic forwarding algorithm for ad-hoc networks.

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

[2]  Klara Nahrstedt,et al.  A scalable location management scheme in mobile ad-hoc networks , 2001, Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks.

[3]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[4]  Srdjan Capkun,et al.  Secure positioning of wireless devices with application to sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[6]  Udo W. Pooch,et al.  Play alone or together - truthful and efficient routing in wireless ad hoc networks with selfish nodes , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[7]  Mukesh Singhal,et al.  A Fair Distributed Solution for Selfish Nodes Problem in Wireless Ad Hoc Networks , 2004, ADHOC-NOW.

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

[9]  Markus Jakobsson,et al.  A charging and rewarding scheme for packet forwarding in multi-hop cellular networks , 2003, MobiHoc '03.

[10]  Dirk Westhoff,et al.  Context aware detection of selfish nodes in DSR based ad-hoc networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[11]  Ivan Stojmenovic,et al.  Position-based routing in ad hoc networks , 2002, IEEE Commun. Mag..

[12]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

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

[14]  Jean-Yves Le Boudec,et al.  Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[15]  Pietro Michiardi,et al.  Prevention of denial of service attacks and selfishness in mobile ad hoc networks , 2002 .

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

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

[18]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

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

[20]  Klara Nahrstedt,et al.  iPass: an incentive compatible auction scheme to enable packet forwarding service in MANET , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

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

[22]  C. Aliprantis,et al.  Games and Decision Making , 1999 .

[23]  Hugo M. Miranda.  Preventing selfishness in open mobile ad hoc networks , 2002 .

[24]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.