Effective channel assignments in cognitive radio networks

Authors:
Jie Wu;Ying Dai;Yanchao Zhao
Affiliations:
Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, United States;Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, United States;Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, United States and State Key Lab of Novel Software, Department of Computer Science and Technology, Nanjin ...
Venue:
Computer Communications
Year:
2013

Citing 13
Cited 0

Parallel symmetry-breaking in sparse graphs

SIAM Journal on Discrete Mathematics
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Fast distributed graph coloring with O(&Dgr;) colors

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Some simple distributed algorithms for sparse networks

Distributed Computing
Graph Theory With Applications

Graph Theory With Applications
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges

IEEE Transactions on Mobile Computing
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Allocating dynamic time-spectrum blocks in cognitive radio networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
NP-completeness of list coloring and precoloring extension on the edges of planar graphs

Journal of Graph Theory
Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
A survey on the channel assignment problem in wireless networks

Wireless Communications & Mobile Computing
Maximizing Capacity in Multihop Cognitive Radio Networks under the SINR Model

IEEE Transactions on Mobile Computing
The impact of interference on the performance of a multi-path metropolitan wireless mesh network

ISCC '11 Proceedings of the 2011 IEEE Symposium on Computers and Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Cognitive radio networks (CRNs) promise to be the next generation of the key enabling technology that enables dynamic spectrum access (DSA). The channel assignment (CA) problem is one of the most important issues in CRNs, with the objective of satisfying the interference constraints, and maximizing the number of nodes with channels assigned. In this paper, our goal is to design highly-efficient and localized protocols for CA. In addition, we want to maximize node connectivity after CA, which is important for packet delivery. To this end, we design two basic algorithms and an advanced algorithm framework. Within this framework, we can change the edge priority in CA to meet different requirements. Simulation results show that the proposed framework is fast (two rounds of communication among nodes, regardless of network size) and outperforms an existing method.