A Routing Protocol using Game Theory in Wireless Ad Hoc Networks

Wireless ad hoc networks (WAHN) with easy maintenance, self-organization and management capabilities, and low cost properties will play a great role in the continued development of new commercial applications. We propose a routing protocol using game theory applied to the routing within the highly independent wireless ad hoc networks. However, the development of each network node's routing cost must be in line with Nash equilibrium. We use the VCG mechanism to assess and calculate the network route, the minimum cost routing path with the shortest route.

---

W artykule zaproponowano protokół routowania, wykorzystujący teorię gier dla niezależnych sieci bezprzewodowych ad hoc. W celu utrzymania równowagi Nasha w kosztach routowania korzeni sieci, zastosowano mechanizm VCG. Pozwoliło to na wyznaczanie najmniej kosztownego sposobu routowania.