• DocumentCode
    2330743
  • Title

    Multi-Channel Assignment in Wireless Sensor Networks: A Game Theoretic Approach

  • Author

    Yu, Qing ; Chen, Jiming ; Fan, Yanfei ; Shen, Xuemin Sherman ; Sun, Youxian

  • Author_Institution
    State Key Lab. of Ind. Control Technol., Zhejiang Univ., Hangzhou, China
  • fYear
    2010
  • fDate
    14-19 March 2010
  • Firstpage
    1
  • Lastpage
    9
  • Abstract
    In this paper, we formulate multi-channel assignment in Wireless Sensor Networks (WSNs) as an optimization problem and show it is NP-hard. We then propose a distributed Game Based Channel Assignment algorithm (GBCA) to solve the problem. GBCA takes into account both the network topology information and transmission routing information. We prove that there exists at least one Nash Equilibrium in the channel assignment game. Furthermore, we analyze the sub-optimality of Nash Equilibrium and the convergence of the Best Response in the game. Simulation results are given to demonstrate that GBCA can reduce interference significantly and achieve satisfactory network performance in terms of delivery ratio, throughput, channel access delay and energy consumption.
  • Keywords
    game theory; optimisation; telecommunication network routing; telecommunication network topology; wireless channels; wireless sensor networks; NP-hard; Nash equilibrium; channel access delay; channel assignment game; delivery ratio; distributed game based channel assignment algorithm; energy consumption; game theoretic approach; multichannel assignment; network topology information; optimization problem; transmission routing information; wireless sensor networks; Autonomous agents; Game theory; Interference; Nash equilibrium; Network topology; Protocols; Radio transceivers; Routing; Sensor phenomena and characterization; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2010 Proceedings IEEE
  • Conference_Location
    San Diego, CA
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-5836-3
  • Type

    conf

  • DOI
    10.1109/INFCOM.2010.5461935
  • Filename
    5461935