Analysis of an incentive scheme for ad-hoc networks

OData support
Dr. Telek Miklós
Department of Networked Systems and Services

Wireless ad-hoc networks consist of independent nodes. In the early days of the ad-hoc networks history, when the nodes's independency was minimal, their cooperation was guaranteed. Nowadays, when there are ad-hoc networks with truly independent nodes, cooperation cannot be guaranteed. Without cooperation between the nodes, packets could be lost between the sender and receiver node, communication can be limited. The cooperation ceases between the nodes, because they are selfish, their interest is to optimize their behaviour to serve their own communication needs. To motivate the nodes to cooperate, we need incentive methods. In this paper I will review the history of the ad-hoc networks, their technical background and the currently known incentive methods. I will present the network which I'm using during my simulations and demonstrate an optimizing method for the nodes, which can be beneficial to use both in networks where cooperation is guaranteed and where it isn't guaranteed. Then, using an incentive method based on reputation, I will demonstrate the effect of incitement.


Please sign in to download the files of this thesis.