Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Time synchronization in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
MAC-Layer Scheduling in Cognitive Radio based Multi-Hop Wireless Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
Hi-index | 0.00 |
Cognitive Radios (CRs) address the problems of spectrum scarcity and under-utilization of the spectrum. However, realizing a CR network is neither easy nor straight-forward. The link layer in CR ad hoc networks is responsible for choosing suitable channels, out of the available channels, for setting up communication between nodes. However, the selection of channels amongst the CR nodes in the network is proven to be NP-complete. The need of maximizing the spectrum efficiency in a fair way can be modeled as a graph coloring problem. An Edge coloring heuristic and a Clique determination heuristic algorithms are proposed in this article. We compare the results of these heuristics with the algorithm proposed in [1] J. We also compare the spectrum utilization in all these algorithms.