• DocumentCode
    2572057
  • Title

    Two Rounds Game CSMA algorithm of WSNs

  • Author

    Yang, Jungang ; Shi, Haoshan

  • Author_Institution
    Sch. of Electron. Inf., Northwestern Polytech. Univ., Xi´´an, China
  • Volume
    1
  • fYear
    2010
  • fDate
    30-31 May 2010
  • Firstpage
    270
  • Lastpage
    273
  • Abstract
    Based on game theory, a general mathematical model, named by TRG/CSMA (Two Rounds Game CSMA), is proposed. TRG/CSMA select τ (the sending data packet probability) as optimization variable, and build a model named by n-persons non-cooperative game with mixed strategy. In this article, as special example, the throughput and delay is selected as optimization object, plays a game among n nodes respectively, and arrives at the Nash equilibrium point respectively. Further, it comes into being a compromise τ* between the throughput and the delay in the second round game. At last, we adjust the minimum contention window CWmin on basis of τ*. The simulation experiment indicates that TRG/CSMA improves the transmission efficiency of MAC protocol greatly. Further TRG/CSMA might select more networks performance as optimization object (packet loss, power exhaust, fairness) and play game, the final Nash equilibrium can be used to compromise contradictions of various network performance.
  • Keywords
    access protocols; carrier sense multiple access; game theory; probability; wireless sensor networks; MAC protocol; Nash equilibrium; WSN; data packet probability; game theory; mathematical model; two rounds game CSMA algorithm; wireless sensor networks; Delay; Equations; Game theory; Mathematical model; Media Access Protocol; Multiaccess communication; Nash equilibrium; Performance loss; Throughput; Wireless sensor networks; CSMA; MAC; Nash Equilibrium(NE); game; wireless wensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networking and Digital Society (ICNDS), 2010 2nd International Conference on
  • Conference_Location
    Wenzhou
  • Print_ISBN
    978-1-4244-5162-3
  • Type

    conf

  • DOI
    10.1109/ICNDS.2010.5479140
  • Filename
    5479140