Modeling energy constrained routing in selfish ad hoc networks

In static networks, game theory has long been used to model the routing decisions of network nodes. However, once we move to dynamic and resource constrained settings, such as ad hoc or sensor networks, traditional models are no longer sufficient. Instead, new models that capture the dynamic nature of the decisions and the resource constraints of the devices are needed. To date, several models that attempt to capture the dynamic nature of routing decisions have been proposed. However, the resource constraints of the devices and the uncertainty about the resources of other devices have been thus far ignored. To this end, we present a game theoretic model that formalizes the resources of the nodes and the beliefs the nodes have about the resources of other nodes. We also discuss the structure of strategies in the proposed model and make explicit the role the resources and beliefs of the nodes play in routing decisions. In addition to presenting a game theoretic model, we propose a method that allows the nodes to learn equilibrium strategies over time, and prove that the strategies suggested by the mechanism converge to a sequential equilibrium. Finally, we present simulations that give insights into the expected behavior of the devices under the proposed model.