GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Proceedings of the 9th annual international conference on Mobile computing and networking
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
iPass: An Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in MANET
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Modelling incentives for collaboration in mobile ad hoc networks
Performance Evaluation - Selected papers from the first workshop on modeling and optimization in mobile, ad hoc and wireless networks (WiOpt'2003)
Hidden-action in multi-hop routing
Proceedings of the 6th ACM conference on Electronic commerce
Proceedings of the 11th annual international conference on Mobile computing and networking
A Reputation-based Mechanism for Isolating Selfish Nodes in Ad Hoc Networks
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
OURS: optimal unicast routing systems in non-cooperative wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Achieving cooperation in multihop wireless networks of selfish nodes
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Sustaining cooperation in multi-hop wireless networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Game Theoretic Analysis of Cooperation Stimulation and Security in Autonomous Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Hidden information and actions in multi-hop wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Some game-theoretic problems in wireless ad-hoc networks
NGI'04 Proceedings of the First international conference on Wireless Systems and Mobility in Next Generation Internet
Self organization in mobile ad hoc networks: the approach of Terminodes
IEEE Communications Magazine
Game theory and the design of self-configuring, adaptive wireless networks
IEEE Communications Magazine
Hi-index | 0.00 |
-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.