Brahma, Swastik and Chatterjee, Mainak (2012) A Truthful Optimal Path Auction for DSA Networks. In: 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications.
![[thumbnail of 14188.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "14188.pdf")
PDF
14188.pdf
Download (147kB)
Abstract
In this paper, we 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. We propose a path auction scheme in which each secondary
node announces its cost and capacity to the routing mechanism
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 09:24 |
| Last Modified: | 18 Apr 2026 02:04 |
| URI: | http://eprints.eai.eu/id/eprint/5825 |
Actions (login required)
- View Item