NexTech 2021 Congress
October 03, 2021 to October 07, 2021 - Barcelona, Spain

  • UBICOMM 2021, The Fifteenth International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies
  • ADVCOMP 2021, The Fifteenth International Conference on Advanced Engineering Computing and Applications in Sciences
  • SEMAPRO 2021, The Fifteenth International Conference on Advances in Semantic Processing
  • AMBIENT 2021, The Eleventh International Conference on Ambient Computing, Applications, Services and Technologies
  • EMERGING 2021, The Thirteenth International Conference on Emerging Networks and Systems Intelligence
  • DATA ANALYTICS 2021, The Tenth International Conference on Data Analytics
  • GLOBAL HEALTH 2021, The Tenth International Conference on Global Health Challenges
  • CYBER 2021, The Sixth International Conference on Cyber-Technologies and Cyber-Systems

SoftNet 2021 Congress
October 03, 2021 to October 07, 2021 - Barcelona, Spain

  • ICSEA 2021, The Sixteenth International Conference on Software Engineering Advances
  • ICSNC 2021, The Sixteenth International Conference on Systems and Networks Communications
  • CENTRIC 2021, The Fourteenth International Conference on Advances in Human-oriented and Personalized Mechanisms, Technologies, and Services
  • VALID 2021, The Thirteenth International Conference on Advances in System Testing and Validation Lifecycle
  • SIMUL 2021, The Thirteenth International Conference on Advances in System Simulation
  • SOTICS 2021, The Eleventh International Conference on Social Media Technologies, Communication, and Informatics
  • INNOV 2021, The Tenth International Conference on Communications, Computation, Networks and Technologies
  • HEALTHINFO 2021, The Sixth International Conference on Informatics and Assistive Technologies for Health-Care, Medical Support and Wellbeing

NetWare 2021 Congress
November 14, 2021 to November 18, 2021 - Athens, Greece

  • SENSORCOMM 2021, The Fifteenth International Conference on Sensor Technologies and Applications
  • SENSORDEVICES 2021, The Twelfth International Conference on Sensor Device Technologies and Applications
  • SECURWARE 2021, The Fifteenth International Conference on Emerging Security Information, Systems and Technologies
  • AFIN 2021, The Thirteenth International Conference on Advances in Future Internet
  • CENICS 2021, The Fourteenth International Conference on Advances in Circuits, Electronics and Micro-electronics
  • ICQNM 2021, The Fifteenth International Conference on Quantum, Nano/Bio, and Micro Technologies
  • FASSI 2021, The Seventh International Conference on Fundamentals and Advances in Software Systems Integration
  • GREEN 2021, The Sixth International Conference on Green Communications, Computing and Technologies

TrendNews 2021 Congress
November 14, 2021 to November 18, 2021 - Athens, Greece

  • CORETA 2021, Advances on Core Technologies and Applications
  • DIGITAL 2021, Advances on Societal Digital Transformation

 


ThinkMind // COCORA 2012, The Second International Conference on Advances in Cognitive Radio // View article cocora_2012_3_20_60030


Optimal Algorithm for Cognitive Spectrum Decision Making

Authors:
Ming-Xue Liao
Xiao-Xin He
Xiao-Hong Jiang

Keywords: cognitive radio network; spectrum decision making; maximal biclique; dynamic threshold

Abstract:
In this paper, an optimal algorithm of spectrum decision making is presented for a real cognitive radio network with tree-based topology. All nodes of a subnet in such network have the capability in being aware of spectrum information by both energy detector based sensing and centralized cooperative sensing. After gathering sensed information, the master node will decide which frequency can be used by the subnet and which slave nodes should leave the subnet if there is no common frequency among all nodes. The problem is how to keep nodes staying in the subnet as many as possible. Traditionally, this is a combination-optimization problem. By mapping the node set and frequency set to be both parts of a bipartite graph respectively, the problem can be turned into a special case of searching for maximal bicliques. Based on a well-known LCM (Linear time Closed itemset Miner) algorithm, and using some new techniques in terms of dynamic thresholds and efficient management of closeness states, we have solved this problem for our application requiring real-time performance. For some special cases where nodes in a subnet may have different weights, our algorithm can also find an optimal solution with maximal weights in real time.

Pages: 50 to 56

Copyright: Copyright (c) IARIA, 2012

Publication date: April 29, 2012

Published in: conference

ISSN: 2308-4251

ISBN: 978-1-61208-197-7

Location: Chamonix, France

Dates: from April 29, 2012 to May 4, 2012

SERVICES CONTACT
2010 - 2017 © ThinkMind. All rights reserved.
Read Terms of Service and Privacy Policy.