IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v8y2012i8p840391.html
   My bibliography  Save this article

A Dynamic Pricing Scheme for Congestion Game in Wireless Machine-to-Machine Networks

Author

Listed:
  • Zhifei Mao
  • Guofang Nan
  • Minqiang Li

Abstract

The problem of assigning a set of source nodes to a set of routes in wireless machine-to-machine (M2M) networks is addressed using a game theoretic approach. The objective is to minimize the maximum latency over all source nodes as far as possible while the game achieves a pure Nash Equilibrium (NE). To compute such an NE efficiently, we present a distributed dynamic pricing (DP) scheme, where each source node is assumed to pay for using any route so that the route has incentive to relay data for the source node. A loose upper bound is given for the convergence time of DP, and simulation results show that it performs much faster in practice. The price of anarchy in this game is also investigated by comparing DP with a cost-reducing path method; the results show that DP produces optimum assignment in more than 90% of the simulation runs.

Suggested Citation

  • Zhifei Mao & Guofang Nan & Minqiang Li, 2012. "A Dynamic Pricing Scheme for Congestion Game in Wireless Machine-to-Machine Networks," International Journal of Distributed Sensor Networks, , vol. 8(8), pages 840391-8403, August.
    • Handle: RePEc:sae:intdis:v:8:y:2012:i:8:p:840391
    DOI: 10.1155/2012/840391
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/840391
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/840391?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:8:y:2012:i:8:p:840391. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.