Abstract
In Mobile Ad Hoc Networks (MANETs), nodes depend on each other for routing and forwarding packets. Cooperation among nodes is a key issue in such an environment. However, some of the nodes in MANETs may behave selfishly and may not forward packets to save battery and other resources. Since nodes in MANETs communicate on a peer-to-peer basis, without any central authority (which can monitor selfish behavior of nodes), a centralized solution to stimulate cooperation is not suitable. In this paper, we present a distributed solution to judge, punish and re-admit a selfish node, forcing nodes to cooperate with each other. Unlike previous solutions, we focus on the fairness, i.e., to provide the same chance to all nodes to gain services from the network and to offer services to the network. We also consider the location privilege and counting retransmission problems which have not been emphasized in any of the previous solutions. We combine our scheme with AODV. To evaluate the performance of our scheme, we conducted simulations using Glomosim. Simulation results show that the proposed scheme improves data forwarding capability substantially in presence of selfish nodes.
This work is partly supported by NSF grants IIS-0242384 and ITR-0324836.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Buttyan, L., Hubaux, J.-P.: Enforce Service Availability in Mobile Ad-Hoc WANs. In: Proceedings of MobiHOC (2000)
Buttyan, L., Hubaux, J.-P.: Stimulating Cooperation in Selforganizing Mobile Ad Hoc, Technical Report No. DSC/2001/046, Swiss Federal Institute of Technology, Lausanne (July 2001)
Hubaux, J.-P., Buttyan, L., et al.: Toward Mobile Ad-hoc Wans: Terminodes, In Technical Report No. DSC/2000/006, Swiss Federal Institute of Technology, Lausanne (July 2000)
Fratkin, E., Vijayaraghavan, V., Liu, Y., Gutierrez, D., Li, T.M., Baker, M.: Participation Incentives for Ad Hoc Networks, http://www.stanford.edu/yl314/ape/paper.ps
Michiardi, P., Molva, R.: Prevention of Denial of Service Attacks and Selfishness in Mobile Ad Hoc Networks, Research Report RR-02-063 (January 2002)
Buchegger, S., Le-Boudec, J.Y.: Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc networks. In: Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Spain (January 2002)
Buchegger, S., Le-Boudec, J.Y.: Performance Analysis of the Confidant Protocol (Cooperation of Nodes: Fairness in Dynamic Ad-hoc Networks). In: Proceedings of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (Mobi- HOC), Lausanne, CH (June 2002)
Luo, H., Zerfos, P., Kong, J., Lu, S., Zhang, L.: Self-securing Ad Hoc Wireless Networks. In: 7th IEEE Symposium on Computers and Communications (ISCC 2002), Italy (July 2002)
Anderegg, L., Eidenbenz, S.: Ad hoc-VCG:A Truthful and Cost-Efficient Routing Protocol for Mobile Ad hoc Networks With Selfish Agents. In: Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 2003), San Diego (September 2003)
Marti, S., Giuli, T.J., Lai, K., Baker, M.: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. In: Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom), Boston (August 2000)
Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networks, In Internet draft, Mobile Ad Hoc network (MANET) Working Group, IETF (October 1999)
Perkins, C.: Ad-Hoc on-demand Distance Vector Routing, In Internet draft RFC (November 1997)
Miranda, H., Rodrigues, L.: Preventing Selfishness in Open Mobile Ad Hoc Networks. In: Proceedings of 7th CaberNet Radicals Workshop, Bertinoro, Forli, Italy, October 13-16 (2002)
Paul, K., Westhoff, D.: Context Aware Detection of Selfish Nodes in DSR based Ad-Hoc Networks. In: Proceedings of IEEE Vehicular Technology Conference 2002, Vancouver, Canda (2002)
Zhong, S., Chen, J., Yang, Y.R.: Sprite: A Simple, Cheap-Proof, Credit-Based System for Mobile Ad-Hoc Networks, Technical Report Yale/DCS/TR1235, Department of Computer Science, Yale University (July 2002)
Li, J., Jannotti, J., De Coute, D.S.J., Karger, D.R., Morris, R.: A SCalable Location Service for Geographic Ad Hoc Routing. In: Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom), Boston (August 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Giruka, V.C., Singhal, M. (2004). A Fair Distributed Solution for Selfish Nodes Problem in Wireless Ad Hoc Networks. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2004. Lecture Notes in Computer Science, vol 3158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28634-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-28634-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22543-0
Online ISBN: 978-3-540-28634-9
eBook Packages: Springer Book Archive