By Topic

A Cooperation Stimulation Strategy in Wireless Multicast Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Binglai Niu ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada ; Zhao, H.V. ; Hai Jiang

Cooperative multicast is an effective technique to provide reliable multicast service in wireless networks. However, selfish nodes may act as free riders to maximize their payoffs, and an incentive mechanism is needed to stimulate cooperation. In this paper, we employ a game theoretic approach to analyze the interactions among selfish mobile nodes in wireless multicast networks. The cooperation process is modeled as an infinite repeated game and the desired cooperation state that achieves absolute fairness and Pareto optimality is derived. A Worst Behavior Tit-for-Tat (WBTFT) incentive strategy is proposed to stimulate cooperation at the desired cooperation state. In the proposed strategy, a node monitors others' behaviors and makes decisions according to the worst behaved node. With perfect monitoring, we analyze the conditions for the proposed strategy to be subgame perfect. To address the issue of imperfect monitoring, an interval based estimation method is proposed and the subgame perfect equilibrium conditions are derived under the assumption that nodes are bounded rational. Simulation results show that the proposed strategy can efficiently enforce cooperation even with imperfect monitoring, and its performance is close to that when all nodes fully cooperate with each other and when they can perfectly monitor each other's behavior without errors.

Published in:

Signal Processing, IEEE Transactions on  (Volume:59 ,  Issue: 5 )