Title

Cooperation In Ad Hoc Networks With Noisy Channels

Abstract

An underlying assumption of multi-hop data communication in ad hoc networks is that the nodes forward each others' packets. An important challenge in such scenario is to attain mutual cooperation. This paper provides a game theoretic solution to enforce cooperation in ad hoc network in the presence of channel noise. We focus on the packet forwarding process and model it as a hidden action game with imperfect private monitoring. We propose a state machine based strategy to reach Nash Equilibrium. The equilibrium is proved to be a sequential equilibrium with carefully designed system parameters. Furthermore, we extend our discussion to a general ad hoc network scenario by refining the strategy profiles to handle multi-hop packet forwarding. The simulation results illustrate the efficiency of the proposed forwarding strategies. In addition, network throughput performance is measured with respect to parameters like channel loss probability, route hop count and mobility. Results suggest that the performance due to our proposed strategy is in close agreement with that of unconditionally cooperative nodes. © 2009 IEEE.

Publication Date

11-20-2009

Publication Title

2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009

Number of Pages

-

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/SAHCN.2009.5168920

Socpus ID

70449566762 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/70449566762

This document is currently not available here.

Share

COinS