Optimal forwarding for wireless ad hoc networks with game theory
by Lu Yan, Stephen Hailes
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 1, No. 4, 2008

Abstract: Every node in a wireless ad hoc network is both end host (it generates its own data and routing traffic) and infrastructure (it forwards traffic for others), but rational nodes have no incentive to cooperatively forward traffic for others, since this kind of forwarding is not costless. In this article, we use game theory to analyse cooperative mechanisms and derive optimal criteria in forwarding. Distinguished from previous works, we take the consideration of realistic scenarios such as noise, non-simultaneously, non-perfect measurement and different strategies by the nodes.

Online publication date: Fri, 28-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com