Title page for ETD etd-05032012-140854

Type of Document Master's Thesis
Author Ali, Daniel Ray
Author's Email Address dali06@vt.edu
URN etd-05032012-140854
Title Scalable Parameter Management using Casebased Reasoning for Cognitive Radio Applications
Degree Master of Science
Department Electrical and Computer Engineering
Advisory Committee
Advisor Name Title
Park, Jung-Min Jerry Committee Chair
Amanna, Ashwin E. Committee Member
Clancy, T. Charles Committee Member
  • Cognitive Radio
  • Casebased Reasoning
  • Data Structure
  • Access Time
Date of Defense 2012-05-01
Availability unrestricted
Cognitive radios have applied various forms of artificial intelligence (AI) to wireless systems in order to solve the complex problems presented by proper link management, network traffic balance, and system efficiency. Casebased reasoning (CBR) has seen attention as a prospective avenue for storing and organizing past information in order to allow the cognitive engine to learn from previous experience. CBR uses past information and observed outcomes to form empirical relationships that may be difficult to model apriori. As wireless systems become more complex and more tightly time constrained, scalability becomes an apparent concern to store large amounts of information over multiple dimensions. This thesis presents a renewed look at an abstract application of CBR to CR. By appropriately designing a case structure with useful information both to the cognitive entity as well as the underlying similarity relationships between cases, an accurate problem description can be developed and indexed. By separating the components of a case from the parameters that are meaningful to similarity, the situation can be quickly identified and queried given proper design. A data structure with this in mind is presented that orders cases in terms of general placement in Euclidean space, but does not require the discrete calculation of distance between the query case and all cases stored. By grouping possible similarity dimension values into distinct partitions called "similarity buckets", a data structure is developed with constant (O(1)) access time, which is an improvement of several orders of magnitude over traditional linear approaches (O(n)).
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  Ali_DR_T.pdf 936.28 Kb 00:04:20 00:02:13 00:01:57 00:00:58 00:00:04

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.