Date Added: Nov 2012
The authors investigate the fair channel assignment and access design problem for cognitive radio ad hoc network in this paper. In particular, they consider a scenario where ad hoc network nodes have hardware constraints which allow them to access at most one channel at any time. They investigate a fair channel allocation problem where each node is allocated a subset of channels which are sensed and accessed periodically by their owners by using a MAC protocol. Toward this end, they analyze the complexity of the optimal brute-force search algorithm which finds the optimal solution for this NP-hard problem. They then develop low-complexity algorithms that can work efficiently with a MAC protocol algorithm, which resolves the access contention from neighboring secondary nodes.