An approach for promoting contribution in GAF-based ad hoc networks: design and implementation

ABSTRACT

In wireless ad hoc networks, all nodes are routers that are required to forward packets for each other. Undoubtedly, nodes that forward more packets will run out of power before others will. To save energy, some nodes may become selfish and refuse to forward packets. As a result, the overall system performance will be degraded with the increased number of selfish nodes. This problem is more severe in networks that employ a wake-sleep schedule for energy savings (e.g., GAF-based networks). Even if a few of active nodes (leader nodes in GAF) are selfish, such a network may be virtually partitioned. Therefore, we propose two schemes to detect and to punish selfish nodes as well as to reduce the possibility of virtual network partition: SWD and GAFSWD. In SWD, only GAF-leader nodes are watchdogs. This watchdog concept is further developed into GAFSWD whereby non-leader nodes take turn to be additional watchdogs for detecting selfish nodes and to be candidates for alternative routes when needed. The results indicate that our schemes achieve significantly better fair ratio and delivery ratio while incurring small false conviction under investigated scenarios.

REFERENCES

• 1: K. Balakrishnan, J. Deng, and P.K. Varshney, "TWOACK: Preventing Selfishness in Mobile Ad Hoc Networks," in WCNC, New Orleans, LA, USA, 2005.
• 2: Sonja Buchegger , Jean-Yves Le Boudec, Performance analysis of the CONFIDANT protocol, Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, June 09-11, 2002, Lausanne, Switzerland [doi>10.1145/513800.513828]
• 3: J.-P. Hubaux, J.-Y.L. Boudec, S. Giordano, and M. Hamdi, "The Terminode Project: Towards Mobile Ad-Hoc WANs," in MOMUC, San Diego, 1999.
• 4: Sergio Marti , T. J. Giuli , Kevin Lai , Mary Baker, Mitigating routing misbehavior in mobile ad hoc networks, Proceedings of the 6th annual international conference on Mobile computing and networking, p.255-265, August 06-11, 2000, Boston, Massachusetts, United States [doi>10.1145/345910.345955]
• 5: Pietro Michiardi , Refik Molva, Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks, Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security, p.107-121, September 26-27, 2002
• 6: Hugo Miranda , Luís Rodrigues, Friends and Foes: Preventing Sel.shness in Open Mobile Ad Hoc Networks, Proceedings of the 23rd International Conference on Distributed Computing Systems, p.440, May 19-22, 2003
• 7: FAIR: Fee Arbitrated Incentive Architecture in Wireless Ad Hoc Networks, Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium, p.38, May 25-28, 2004
• 8: B. Raghavan and A.C. Snoeren, "Priority Forwarding in Ad Hoc Networks with Self-Interested Parties," in P2PECON, 2003.
• 9: Y. Wang, V. Giruka, and M. Singhal, "A Fair Distributed Solution for Selfish Nodes Problem in Wireless Ad-Hoc Networks," in ADHOC-NOW, Vancouver, British Columbia, 2004, pp. 211--224.
• 10: Y. Xu, J. Heidemann, and D. Estrin, "Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks," Technical Report 527, USC/ISI, 2000.
• 11: Ya Xu , John Heidemann , Deborah Estrin, Geography-informed energy conservation for Ad Hoc routing, Proceedings of the 7th annual international conference on Mobile computing and networking, p.70-84, July 2001, Rome, Italy [doi>10.1145/381677.381685]
• 12: S. Zhong, J. Chen, and Y.R. Yang, "Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks," in the 22th IEEE INFOCOM, 2003, pp. 1987 -- 1997.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

General Terms:
Algorithms, Design, Experimentation, Performance

Keywords:
GAF, selfish node detection, wireless ad hoc networks