| In this thesis, several studies of incentive compatibility in wireless networks were presented. In particular, the thesis focuses on two subareas of wireless networks: network coding technique and cooperative relay service in cognitive radio networks. In aspect of network coding, I presented a general cheating detection scheme in which a node can initiate a threshold decision session when it believes its payment was miscalculated. Then I extended the work to the incentive scheme for packet forwarding and payment reduction in wireless networks using XOR network coding. In aspect of cooperative relay, I designed a scheme that provides incentives for the secondary users to truthfully report information to the primary user, which is the first cheat proof scheme for cooperative relay in cognitive radio networks. In this work, we apply solution concepts in game theory to rigorously guarantee that our schemes will stimulate users to cooperate to the best of their interests. Then algorithms for cooperative relay protocols with general utility functions were presented, since we find there is no existing protocol that provides Nash equilibrium solutions for general cases. Lastly, I designed algorithms for cooperative relay among secondary users, which guarantees that, under a precondition called No Monopoly, all relay nodes have incentives to truthfully share their relay information. |
