An algorithm of channel assignment of MAC layer in ad hoc network based on dynamic game with perfect and complete information

Abstract

The nodes in Ad Hoc networks compete channels when communicating, with the features of no center and self-organization. In traditional channel assignment strategy of MAC layer, each node does not consider the demands to channel resource of other nodes, which hinders improving the network performance. An algorithm of channel assignment based on complete and perfect information dynamic game theory is proposed, supposing all the nodes are rational and greedy. Each node selects channels dynamically by backward induction due to strategies of other nodes, thus lead to Nash equilibrium finally. Experiments show that the network throughput is improved and the packet loss rate is reduced by this method effectively. © 2012 Springer-Verlag.