Abstract
In multi-hop ad hoc networks, communications rely heavily on cooperation of each node. Albeit a good teamwork will run the wireless networks well, some selfish behaviors could definitely break them down. This paper examines the theoretical aspect of selfish nodes through a non-cooperative game framework. Depending on the tradeoff between the nodes packet generating requirements and forwarding preferences, we introduce a unique “cost and compensation” scheme: the nodes first select their initial packet generating rates, in order to attain their desired values, they adjust the rates according to the associated cost reflected by network status; and they are also compensated once they forward packets for other nodes. We then propose a distributed algorithm to achieve optimal point for individual node–Nash Equilibrium(NE). Finally, simulation results show that proposed scheme is effective to enforce the potentially selfish nodes to co-operate.
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
ButtyLan, L., Hubaux, J.-P.: Stimulating Cooperation in Self-Organizing Mobile Ad Hoc@Networks. ACM/Kluwer Mobile Networks and Applications (MONET) 8(5) (October 2003)
Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., Rao, R.R.: Cooperation in Wireless Ad Hoc Networks. In: Proc. of IEEE INFOCOM, San Francisco, March 30-April 3 (2003)
Buchegger, S., Le Boudec, J.-Y.: Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes - Fairnes in Distributed Ad-hoc NeTworks. In: MobiHoc 2002, Lausanne, June 9-11 (2002)
Zhong, S., Chen, J., Yang, Y.R.: Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks. In: Pro. of IEEE INFOCOM 2003, San Francisco, CA (April 2003)
Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: a Truthful and Cost-Efficient Routing Protocol for Mobile Ad hoc Networks with Selfish Agents. In: Mobicom, San Diego,California (September 2003)
Crowcroft, J., Gibbens, R., Kelly, F., Ostring, S.: Modelling Incentives for Collaboration in Mobile Ad Hoc Networks. In: Proc. of Modeling and Optimization in Mobile Ad Hoc and Wireless Networks (WiOpt)2003, INRIA Sophia-Antipolis, France, March 3-5 (2003)
Saraydar, C., Mandayam, N., Goodman, D.: Efficient power control via pricing in wireless data networks. IEEE Trans. Communications 50(2) (February 2002)
Yaiche, H., Mazumdar, R.R., Rosenberg, C.: A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Transactions on Networking 8(5), 667–678 (2000)
Rosen, J.B.: Existence and uniqueness of equilibrium points for concave n-person game. Econometrica 33, 520–534 (1965)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, M., Kamioka, E., Yamada, S., Cui, Y. (2005). Efficient Node Forwarding Strategies via Non-cooperative Game for Wireless Ad Hoc Networks. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_37
Download citation
DOI: https://doi.org/10.1007/11534310_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28102-3
Online ISBN: 978-3-540-31868-2
eBook Packages: Computer ScienceComputer Science (R0)