M.Sc Student | Drabkin Anna |
---|---|

Subject | Maximum lifetime Equilibrium in topology control games in ad hoc networks |

Department | Department of Industrial Engineering and Management |

Supervisors | Professor Ariel Orda |

Mr. Amir Ronen | |

Full Thesis text |

This thesis addresses a problem at the nexus of networking and game theory: how self interested nodes construct network topologies in wireless communication networks? Through a unified utility-based framework, we study topology control problems in distributed wireless networks.

We consider the
following network topology game: Given is a wireless communications network
shared by *n* selfish nodes, each with a limited energy supply (battery).
Each node aims to be connected to all the other nodes in the network for a
maximal amount of time. The welfare of the system is the maximal period in
which all nodes are connected. Each node chooses its own transmission power and
thus its lifetime.

We prove that every such
game admits a pure Nash equilibrium. While at the worst case the price of
anarchy of connectivity games can be *Θ(n ^{α})*, where α
is the path loss factor and