On generating all maximal independent sets
Information Processing Letters
Convex Optimization
Linear Programming and Network Flows
Linear Programming and Network Flows
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The capacity of wireless networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we study the joint spectrum allocation and scheduling problems with the objectives of maximizing through-put and achieving certain fairness in Dynamic Spectrum Access (DSA) wireless networks. A novel Multi-Channel Contention Graph (MCCG) is proposed to characterize the impact of interference under the protocol interference model. Based on MCCG, we present an optimal scheme to compute maximum throughput solutions. As simply maximizing throughput may result in a severe bias on resource allocation, we take fairness into consideration by presenting optimal schemes to compute fair solutions based on a simplified max-min fairness model and the well-known proportional fairness model. Fast and effective heuristics are also proposed to provide high throughput and fair solutions. Numerical results show that compared with the optimal schemes, our heuristic schemes produce very close performance and our proportional fair schemes achieve a good tradeoff between throughput and fairness. In addition, we extend our research to the physical interference model.