About this Journal Submit a Manuscript Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 840391, 9 pages
Research Article

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

1Institute of System Engineering, Tianjin University, Tianjin 300072, China
2Department of Information Management and Management Science, Tianjin University, Tianjin 300072, China

Received 8 April 2012; Revised 9 July 2012; Accepted 9 July 2012

Academic Editor: Jianhua He

Copyright © 2012 Zhifei Mao et al. 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.


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.