Suri, Rama N and Narahari, Y (2006) An auction algorithm for procuring wireless channel in a heterogenous wireless network. In: 3rd International Conference on Wireless and Optical Communications Networks, Apr 11-13, 2006, Bangalore, India, pp. 55-59.
01666541.pdf - Published Version
Restricted to Registered users only
Download (1032Kb) | Request a copy
In this paper, we develop a novel auction algorithm for procuring wireless channel by a wireless node in a heterogeneous wireless network. We assume that the service providers of the heterogeneous wireless network are selfish and non-cooperative in the sense that they are only interested in maximizing their own utilities. The wireless user needs to procure wireless channels to execute multiple tasks. To solve the problem of the wireless user, we propose a reverse optimal (REVOPT) auction and derive an expression for the expected payment by the wireless user. The proposed auction mechanism REVOPT satisfies important game theoretic properties such as Bayesian incentive compatibility and individual rationality.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||Heterogeneous wireless network;game theory;mechanism design;selfishness;rationality;individual rationality;Bayesianincentive compatibility;optimal auction mechanisms.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||27 Aug 2010 06:16|
|Last Modified:||19 Sep 2010 06:12|
Actions (login required)