A Truthful Optimal Path Auction for DSA Networks

In this paper, the authors address the problem of incentive based routing in DSA networks, where each secondary node having a certain capacity incurs a cost for routing traffic through it. They propose a path auction scheme in which each secondary node announces its cost and capacity to the routing mechanism, both of which are considered as private information known only to the node. They design a route selection mechanism and a pricing function that can induce nodes to reveal their cost and capacity honestly, while minimizing the payment that needs to be given to the nodes.

Provided by: ICST Topic: Mobility Date Added: Jun 2011 Format: PDF

Find By Topic