Coordinating secondary-user behaviors for inelastic traffic reward maximization in large-scale DSA networks Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/cn69m638t

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • We develop efficient coordination techniques that support inelastic traffic in large-scale distributed dynamic spectrum access DSA networks. By means of any learning algorithm, the proposed techniques enable DSA users to locate and exploit spectrum opportunities effectively, thereby increasing their achieved throughput (or "rewards" to be more general). Basically, learning algorithms allow DSA users to learn by interacting with the environment, and use their acquired knowledge to select the proper actions that maximize their own objectives, thereby "hopefully" maximizing their long-term cumulative received reward/throughput. However, when DSA users' objectives are not carefully coordinated, learning algorithms can lead to poor overall system performance, resulting in lesser per-user average achieved rewards. In this thesis, we derive efficient objective functions that DSA users an aim to maximize, and that by doing so, users' collective behavior also leads to good overall system performance, thus maximizing each user's long-term cumulative received rewards. We show that the proposed techniques are: (i) efficient 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) distributive by being implementable in a decentralized manner.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Submitted by Mohammadjavad Noroozoliaee (noroozom@onid.orst.edu) on 2013-04-01T21:52:22Z No. of bitstreams: 1 NoroozOliaeeMohammadJavad2013.pdf: 392570 bytes, checksum: 55eb279ac88c46f52fa5de6816782627 (MD5)
  • description.provenance : Submitted by Mohammadjavad Noroozoliaee (noroozom@onid.orst.edu) on 2013-03-19T23:42:44Z No. of bitstreams: 1 NoroozOliaeeMohammadJavad2013.pdf: 391833 bytes, checksum: e114de81f1099bca22239e19b349349a (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2013-04-02T16:57:17Z (GMT) No. of bitstreams: 1 NoroozOliaeeMohammadJavad2013.pdf: 392570 bytes, checksum: 55eb279ac88c46f52fa5de6816782627 (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2013-04-02T22:30:51Z (GMT) No. of bitstreams: 1 NoroozOliaeeMohammadJavad2013.pdf: 392570 bytes, checksum: 55eb279ac88c46f52fa5de6816782627 (MD5)
  • description.provenance : Rejected by Julie Kurtz(julie.kurtz@oregonstate.edu), reason: Rejected to remove the Acknowlegement page and List of Algorithms page. Once revised, open the item that was rejected. Replace the attached file with the revised file and resubmit. Thanks, Julie on 2013-03-20T19:23:16Z (GMT)
  • description.provenance : Made available in DSpace on 2013-04-02T22:30:52Z (GMT). No. of bitstreams: 1 NoroozOliaeeMohammadJavad2013.pdf: 392570 bytes, checksum: 55eb279ac88c46f52fa5de6816782627 (MD5) Previous issue date: 2013-03-06

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items