Energy Efficient Connectivity in Ad Hoc Networks From User's and Designer's Perspective
The authors consider a game that models the creation of a wireless ad hoc network, where nodes are owned by selfish agents. They study a novel cost sharing model in which agents may pay for the transmission power of the other nodes. Each agent has to satisfy some connectivity requirement in the final network and the goal is to minimize its payment with no regard to the overall system performance. They analyze two fundamental connectivity games, namely broadcast and convergecast. They study pure Nash equilibria and quantify the degradation in the network performance called the price of anarchy resulting from selfish behavior. They derive tight bounds on the price of anarchy for these games.