Using incompletely cooperative game theory in wireless sensor networks


Published on

  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

Using incompletely cooperative game theory in wireless sensor networks

  1. 1. Using Incompletely Cooperative Game Theory in Wireless Sensor NetworksLiqiang Zhao, Hailin Zhang, and Jie ZhangWCNC 2008Presented by: Abolfazl Asudeh
  2. 2. Outline Background and Problem statement Incompletely cooperative game GMAC and Simulation Results 2 4/11/2013
  3. 3.  Wireless Sensor Networks (WSNs) have a wide range of potential applications including environment monitoring, smart spaces, medical systems and robotic exploration. Energy Consumption is usually the more important metric  other metrics: Delay, Throughput, … A lot of interest in performance analysis and improvement, specially in Medium Access Control (MAC) protocols. 3 4/11/2013
  4. 4. Main Categories of MAC protocols of WSNs Scheduled Protocols: use a predefined schedule for data transmission - TSMP Data Ack Sender Tg Data Ack Tg Tg Receiver Time Slot Protocols with Common Active Period: Nodes wake up and sleep together to reduce the energy cost of idle listening. - SMAC  idle listening: when the nodes are awake, but there is no packet in the channel to be transmitte  Usually use CSMA/CA (RTS/CTS) for data transmission 4 4/11/2013
  5. 5. Main Categories of MAC protocols of WSNs Preamble Sampling Protocols: Every node wakes up periodically and check if there is a packet in the channel; the sender sends a long preamble before sending the data. – Preamble Sampling Aloha Preamble Data Sender Check Interval Data Receiver Hybrid Protocols: the combinations of the protocols of different categories 5 4/11/2013
  6. 6.  Game Theory is used broadly in distributed WSNs to solve problems like:  Security  Routing  Power Control The goal of this paper: to achieve energy consumption, delay, and throughput together Main focus is on Common Active MAC protocols 6 4/11/2013
  7. 7.  Sensor networks are energy constraint  explicit cooperation among nodes is impractical. It can be modeled as an incompletely cooperative game, a stochastic game, which starts when a new packet arrives at the node’s transmission buffer and ends when the packet is transmitted successfully or discarded. Each game process includes many timeslots and each timeslot corresponds to one game state. 7 4/11/2013
  8. 8.  In each timeslot, each player (i.e., node) estimates the current game state based on what happened in the past timeslots. Then adjusts its own equilibrium strategy by tuning its local contention parameters 8 4/11/2013
  9. 9. Framework Contains three major components  a detector: detect and record current conditions  an estimator: estimates current state, such as number of nodes  an adjustor: makes the decision for the strategy and adjusts the contention parameters 9 4/11/2013
  10. 10. The Game model of N+1 nodes10 4/11/2013
  11. 11. GMAC: the simplified MAC solution The Estimation of n is inaccurate in unsaturated environments. GMAC is the simplified version. In G-MAC, after transmitting a packet, no matter it is transmitted successfully or not, the player does not start the next game process with the nominal CWmin. 12 4/11/2013
  12. 12. Simulation Results  channel rate: 1Mbps  n = 30  packet arrival: Poisson  active period: 250msec13 4/11/2013
  13. 13. References A. Bachir, M. Dohler, Th. Watteyne, and K.K. Leung, “MAC Essentials for Wireless Sensor Networks”, IEEE COMMUNICATIONS SURVEYS & TUTORIALS, VOL. 12, NO. 2, SECOND QUARTER 2010. Liqiang Zhao; Hailin Zhang; Jie Zhang; , "Using Incompletely Cooperative Game Theory in Wireless Sensor Networks," Wireless Communications and Networking Conference, 2008. WCNC 2008. IEEE , vol., no., pp.1483-1488, March 31 2008-April 3 2008 14 4/11/2013
  14. 14. Thank you Question? 15 4/11/2013