TY - GEN
T1 - Optimal content delivery in DSA networks
T2 - 2012 IEEE International Conference on Communications, ICC 2012
AU - Brahma, Swastik
AU - Varshney, Pramod K.
AU - Chatterjee, Mainak
AU - Kwiat, Kevin
PY - 2012
Y1 - 2012
N2 - In this paper, we address the problem of Optimal Content Delivery (OCD) in Dynamic Spectrum Access (DSA) networks, where the source of a flow sends data traffic to the destination in exchange for some monetary benefit, such as a subscription fee. Also, each intermediate secondary node incurs a cost for routing traffic. We propose a path auction based content delivery mechanism in which each secondary node announces its cost (considered as private information) to the auction mechanism. Based on the announced costs, the optimal flow rate between the end nodes is determined, a multi-path route is chosen and payments are made to the nodes that route traffic, such that the profit of the source node is maximized in sending data to the destination. Furthermore, the auction mechanism is strategy-proof, i.e., it can induce the intermediate nodes to truthfully declare their costs. We provide polynomial time algorithms for implementing our auction based content delivery mechanism in DSA networks.
AB - In this paper, we address the problem of Optimal Content Delivery (OCD) in Dynamic Spectrum Access (DSA) networks, where the source of a flow sends data traffic to the destination in exchange for some monetary benefit, such as a subscription fee. Also, each intermediate secondary node incurs a cost for routing traffic. We propose a path auction based content delivery mechanism in which each secondary node announces its cost (considered as private information) to the auction mechanism. Based on the announced costs, the optimal flow rate between the end nodes is determined, a multi-path route is chosen and payments are made to the nodes that route traffic, such that the profit of the source node is maximized in sending data to the destination. Furthermore, the auction mechanism is strategy-proof, i.e., it can induce the intermediate nodes to truthfully declare their costs. We provide polynomial time algorithms for implementing our auction based content delivery mechanism in DSA networks.
UR - http://www.scopus.com/inward/record.url?scp=84871968871&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84871968871&partnerID=8YFLogxK
U2 - 10.1109/ICC.2012.6364616
DO - 10.1109/ICC.2012.6364616
M3 - Conference contribution
AN - SCOPUS:84871968871
SN - 9781457720529
T3 - IEEE International Conference on Communications
SP - 1843
EP - 1847
BT - 2012 IEEE International Conference on Communications, ICC 2012
Y2 - 10 June 2012 through 15 June 2012
ER -