Paper Info
Title
Multi-path routing in dynamic spectrum access networks: A mechanism design approach
Abstract
In this paper, we address the problem of incentive based routing in Dynamic Spectrum Access (DSA) networks, where each secondary node incurs a cost for routing traffic from a flow and also has a certain capacity that the node can provide to the flow. We 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. We design a route selection mechanism and a pricing function that can induce nodes to reveal their cost and capacity honestly (making our auction truthful), while minimizing the expected payment that needs to be given to the nodes that relay traffic (making our auction optimal). By considering capacity constraint of the nodes, we explicitly support multiple path routing. For deploying our path auction based routing mechanism in DSA networks, we provide polynomial time algorithms.
Year
DOI
Venue
2013
10.1109/ICC.2013.6654983
Communications
Keywords
Field
DocType
commerce,computational complexity,incentive schemes,telecommunication network routing,telecommunication traffic,DSA networks,capacity constraint,dynamic spectrum access networks,incentive based routing,mechanism design approach,multipath routing,multiple path routing,path auction scheme,polynomial time algorithms,pricing function,private information,relay traffic,route selection mechanism,routing traffic,secondary node
Link-state routing protocol,Equal-cost multi-path routing,Dynamic Source Routing,Path vector protocol,Policy-based routing,Static routing,Computer science,Computer network,Destination-Sequenced Distance Vector routing,Geographic routing,Distributed computing
Conference
ISSN
Citations 
PageRank 
1550-3607
0
0.34
References 
Authors
8
2
Name
Order
Citations
PageRank
Swastik Brahma120221.13
Mainak Chatterjee21562175.84