Name
Abstract | ||
|---|---|---|
We consider a distributed IoT network, where each node wants to minimize its age of information and there is a cost to make any transmission. A collision model is considered, where any transmission is successful from a node to a common monitor if no other node transmits in the same slot. There is no explicit communication/coordination between any two nodes. Under this distributed competition model, the objective of this paper is to find a distributed transmission strategy for each node that converges to an equilibrium that depends on the past observations seen by each node. A simple update strategy is shown to converge to an equilibrium, that is in fact a Nash equilibrium for a suitable utility function, that captures all the right tradeoffs for each node. In addition, the price of anarchy for the utility function is shown to approach unity as the number of nodes grows large. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/INFOCOMWKSHPS50562.2020.9162930 | IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS) |
Keywords | DocType | ISSN |
Age of information, distributed equilibrium, game theory | Conference | 2159-4228 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saurav Kumar | 1 | 0 | 0.34 |
| Rahul Vaze | 2 | 463 | 45.64 |