Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
