An MPS-BNS Mixed Strategy Based on Game Theory for Wireless Mesh Networks

To achieve a valid effect of wireless mesh networks against selfish nodes and selfish behaviors in the packets forwarding, an approach named mixed MPS-BNS strategy is proposed in this paper. The proposed strategy is based on the Maximum Payoff Strategy (MPS) and the Best Neighbor Strategy (BNS). In...

Full description

Bibliographic Details
Main Authors: Huang, S. Q., Wang, G. C., Zhen, H. H., Zhang, Z.
Format: Online
Language:English
Published: Hindawi Publishing Corporation 2013
Online Access:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3562672/
id pubmed-3562672
recordtype oai_dc
spelling pubmed-35626722013-02-11 An MPS-BNS Mixed Strategy Based on Game Theory for Wireless Mesh Networks Huang, S. Q. Wang, G. C. Zhen, H. H. Zhang, Z. Research Article To achieve a valid effect of wireless mesh networks against selfish nodes and selfish behaviors in the packets forwarding, an approach named mixed MPS-BNS strategy is proposed in this paper. The proposed strategy is based on the Maximum Payoff Strategy (MPS) and the Best Neighbor Strategy (BNS). In this strategy, every node plays a packet forwarding game with its neighbors and records the total payoff of the game. After one round of play, each player chooses the MPS or BNS strategy for certain probabilities and updates the strategy accordingly. In MPS strategy, each node chooses a strategy that will get the maximum payoff according to its neighbor's strategy. In BNS strategy, each node follows the strategy of its neighbor with the maximum total payoff and then enters the next round of play. The simulation analysis has shown that MPS-BNS strategy is able to evolve to the maximum expected level of average payoff with faster speed than the pure BNS strategy, especially in the packets forwarding beginning with a low cooperation level. It is concluded that MPS-BNS strategy is effective in fighting against selfishness in different levels and can achieve a preferable performance. Hindawi Publishing Corporation 2013-01-17 /pmc/articles/PMC3562672/ /pubmed/23401672 http://dx.doi.org/10.1155/2013/936536 Text en Copyright © 2013 S. Q. Huang et al. https://creativecommons.org/licenses/by/3.0/ This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
repository_type Open Access Journal
institution_category Foreign Institution
institution US National Center for Biotechnology Information
building NCBI PubMed
collection Online Access
language English
format Online
author Huang, S. Q.
Wang, G. C.
Zhen, H. H.
Zhang, Z.
spellingShingle Huang, S. Q.
Wang, G. C.
Zhen, H. H.
Zhang, Z.
An MPS-BNS Mixed Strategy Based on Game Theory for Wireless Mesh Networks
author_facet Huang, S. Q.
Wang, G. C.
Zhen, H. H.
Zhang, Z.
author_sort Huang, S. Q.
title An MPS-BNS Mixed Strategy Based on Game Theory for Wireless Mesh Networks
title_short An MPS-BNS Mixed Strategy Based on Game Theory for Wireless Mesh Networks
title_full An MPS-BNS Mixed Strategy Based on Game Theory for Wireless Mesh Networks
title_fullStr An MPS-BNS Mixed Strategy Based on Game Theory for Wireless Mesh Networks
title_full_unstemmed An MPS-BNS Mixed Strategy Based on Game Theory for Wireless Mesh Networks
title_sort mps-bns mixed strategy based on game theory for wireless mesh networks
description To achieve a valid effect of wireless mesh networks against selfish nodes and selfish behaviors in the packets forwarding, an approach named mixed MPS-BNS strategy is proposed in this paper. The proposed strategy is based on the Maximum Payoff Strategy (MPS) and the Best Neighbor Strategy (BNS). In this strategy, every node plays a packet forwarding game with its neighbors and records the total payoff of the game. After one round of play, each player chooses the MPS or BNS strategy for certain probabilities and updates the strategy accordingly. In MPS strategy, each node chooses a strategy that will get the maximum payoff according to its neighbor's strategy. In BNS strategy, each node follows the strategy of its neighbor with the maximum total payoff and then enters the next round of play. The simulation analysis has shown that MPS-BNS strategy is able to evolve to the maximum expected level of average payoff with faster speed than the pure BNS strategy, especially in the packets forwarding beginning with a low cooperation level. It is concluded that MPS-BNS strategy is effective in fighting against selfishness in different levels and can achieve a preferable performance.
publisher Hindawi Publishing Corporation
publishDate 2013
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3562672/
_version_ 1611952162023145472