TY - GEN
T1 - Aligning spectrum-user objectives for maximum inelastic-traffic reward
AU - Hamdaoui, Bechir
AU - NoroozOliaee, Mohammad Javad
AU - Tumer, Kagan
AU - Rayes, Ammar
PY - 2011
Y1 - 2011
N2 - We develop objective functions for large-scale distributed dynamic spectrum access (DSA) networks that, by means of any learning algorithm, enable DSA users to locate and exploit spectrum opportunities effectively, thereby increasing their achieved throughput (or "rewards" to be more general). We show that the proposed functions are: (i) optimal by enabling users to achieve high rewards, (ii) scalable by performing well in systems with a small as well as a large number of users, (iii) learnable by allowing users to reach up high rewards very quickly, and (iv) distributed by being implementable in a decentralized manner.
AB - We develop objective functions for large-scale distributed dynamic spectrum access (DSA) networks that, by means of any learning algorithm, enable DSA users to locate and exploit spectrum opportunities effectively, thereby increasing their achieved throughput (or "rewards" to be more general). We show that the proposed functions are: (i) optimal by enabling users to achieve high rewards, (ii) scalable by performing well in systems with a small as well as a large number of users, (iii) learnable by allowing users to reach up high rewards very quickly, and (iv) distributed by being implementable in a decentralized manner.
UR - http://www.scopus.com/inward/record.url?scp=80052995666&partnerID=8YFLogxK
U2 - 10.1109/ICCCN.2011.6005926
DO - 10.1109/ICCCN.2011.6005926
M3 - Conference contribution
AN - SCOPUS:80052995666
SN - 9781457706387
T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN
BT - 2011 20th International Conference on Computer Communications and Networks, ICCCN 2011 - Proceedings
T2 - 2011 20th International Conference on Computer Communications and Networks, ICCCN 2011
Y2 - 31 July 2011 through 4 August 2011
ER -