Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1155/2012/840391 | INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS |
Field | DocType | Volume |
Machine to machine,Convergence (routing),Congestion game,Computer science,Upper and lower bounds,Dynamic pricing,Computer network,Price of anarchy,Nash equilibrium,Relay,Distributed computing | Journal | 2012 |
Issue | ISSN | Citations |
null | 1550-1477 | 5 |
PageRank | References | Authors |
0.47 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhifei Mao | 1 | 49 | 2.59 |
| Guofang Nan | 2 | 170 | 15.28 |
| Minqiang Li | 3 | 418 | 37.16 |