close
Skip to main content

Advertisement

Springer Nature Link
Log in
Menu
Find a journal Publish with us Track your research
Search
Saved research
Cart
  1. Home
  2. NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
  3. Conference paper

Non-cooperative Forwarding in Ad-Hoc Networks

  • Conference paper
  • pp 486–498
  • Cite this conference paper
Save conference paper
View saved research
NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems (NETWORKING 2005)
Non-cooperative Forwarding in Ad-Hoc Networks
  • Eitan Altman20,
  • Arzad A. Kherani20,
  • Pietro Michiardi20 &
  • …
  • Refik Molva21 

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3462))

Included in the following conference series:

  • International Conference on Research in Networking
  • 1896 Accesses

  • 56 Citations

Abstract

A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives for collaboration among the participating entities. Forwarding packets of other nodes is an example of activity that requires such a collaboration. However, it may not be in interest of a node to always forward the requesting packets. At the same time, not forwarding any packet may adversly affect the network functioning. Assuming that the nodes are rational, i.e., their actions are strictly determined by their self-interest, we view the problem in framework of non-cooperative game theory and provide a simple punishing mechanism considering end-to-end performance objectives of the nodes. We also provide a distributed implementation of the proposed mechanism. This implementation has a small computational and storage complexity hence is suitable for the scenario under consideration.

Download to read the full chapter text

Chapter PDF

Similar content being viewed by others

Efficient packet transmission in wireless ad hoc networks with partially informed nodes

Article Open access 03 June 2019

Studying Node Cooperation in Reputation Based Packet Forwarding Within Mobile Ad Hoc Networks

Chapter © 2017

Co-operation Enforcing Reputation-Based Detection Techniques and Frameworks for Handling Selfish Node Behaviour in MANETs: A Review

Article 31 July 2017

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.
  • Agricultural Ethics
  • Game Theory
  • Morality
  • Public-Private Partnership
  • Teamwork
  • Utilitarianism
  • Energy-Efficient Protocols in Wireless Sensor Networks

References

  1. Dutta, D., Goel, A., Heidemann, J.: Oblivious AQM and Nash Equilibria. In: IEEE Infocom (2003)

    Google Scholar 

  2. Crowcroft, J., Gibbens, R., Kelly, F., Ostring, S.: Modelling incentives for collaboration in mobile Ad-hoc networks. In: Proceedings of WiOpt 2003, Sophia-Antipolis, France, March 3-5 (2003)

    Google Scholar 

  3. Félegyházi, M., Buttyán, L., Hubaux, J.P.: Equilibrium analysis of packet forwarding strategies in wireless Ad-hoc entworks – the static case. In: PWC 2003 Personal Wireless Communications, Venice, Italy (September 2003)

    Google Scholar 

  4. Michiardi, P., Molva, R.: A game theoretical approach to evaluate cooperation enforcement mechanisms in mobile Ad-hoc networks. In: Proceedings of WiOpt 2003, Sophia-Antipolis, France, March 3-5 (2003)

    Google Scholar 

  5. Samuelson, L.: Subgame Perfection: An Introduction. In: Creedy, J., Borland, J., Eichberger, J. (eds.) Recent Developments in Game Theory, pp. 1–42. Edgar Elgar Publishing (1992)

    Google Scholar 

  6. Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., Rao, R.R.: Cooperation in wireless Ad-hoc networks. In: Proceedings of IEEE Infocom (2003)

    Google Scholar 

  7. Urpi, A., Bonuccelli, M., Giordano, S.: Modelinig cooperation in mobile Ad-hoc networks: a formal description of selfishness. In: Proceedings of WiOpt 2003, Sophia-Antipolis, France, March 3-5 (2003)

    Google Scholar 

  8. Kushner, H.J., Yin, G.: Stochastic Approximation Algorithms and Applications. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  9. Altman, E., Michiardi, P., Molva, R.: Non-cooperative Forwarding in Ad-hoc Networks. INRIA Report No. RR-5116, Sophia-Antipolis, France (February 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, 06902, Sophia Antipolis, France

    Eitan Altman, Arzad A. Kherani & Pietro Michiardi

  2. GET/EURECOM, Sophia-Antipolis, France

    Refik Molva

Authors
  1. Eitan Altman
    View author publications

    Search author on:PubMed Google Scholar

  2. Arzad A. Kherani
    View author publications

    Search author on:PubMed Google Scholar

  3. Pietro Michiardi
    View author publications

    Search author on:PubMed Google Scholar

  4. Refik Molva
    View author publications

    Search author on:PubMed Google Scholar

Editor information

Editors and Affiliations

  1. David R. Cheriton School of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Raouf Boutaba

  2. Department of Computer Science, University of California, Santa Barbara,  

    Kevin Almeroth

  3. Departament de Ciències Matemàtiques i Informàtica, University of Balearic Islands, Carretera de Valldemossa, km 7.5, 07071, Palma de Mallorca, (Spain)

    Ramon Puigjaner

  4. University of Waterloo, Canada

    Sherman Shen & James P. Black & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Altman, E., Kherani, A.A., Michiardi, P., Molva, R. (2005). Non-cooperative Forwarding in Ad-Hoc Networks. In: Boutaba, R., Almeroth, K., Puigjaner, R., Shen, S., Black, J.P. (eds) NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2005. Lecture Notes in Computer Science, vol 3462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422778_39

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/11422778_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25809-4

  • Online ISBN: 978-3-540-32017-3

  • eBook Packages: Computer ScienceComputer Science (R0)Springer Nature Proceedings Computer Science

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Game theory
  • Stochastic approximation algorithm

Publish with us

Policies and ethics

Search

Navigation

  • Find a journal
  • Publish with us
  • Track your research

Footer Navigation

Discover content

  • Journals A-Z
  • Books A-Z
  • Subjects A-Z

Publish with us

  • Journal finder
  • Publish your research
  • Language editing
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our brands

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Discover

Corporate Navigation

  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support
  • Legal notice
  • Cancel contracts here

104.23.197.170

Not affiliated

Springer Nature

© 2026 Springer Nature