Data networks
DIMSUMNet: New Directions in Wireless Networking Using Coordinated Dynamic Spectrum Access
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Utilization and fairness in spectrum assignment for opportunistic spectrum access
Mobile Networks and Applications
Multi-radio channel allocation in competitive wireless networks
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cognitive Radio Technology (Communications Engineering)
Cognitive Radio Technology (Communications Engineering)
Wireless Communications & Mobile Computing - Cognitive Radio, Software Defined Radio And Adaptive Wireless Systems
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
Channel allocation is an important area of research in open spectrum networks which asserts a significant impact on the spectrum utilization and the fairness among users. This paper studies the optimization of channel allocation, considering multiple objectives. For each objective, a binary programming model is described. Then a new optimization objective called fairness constrained maximum throughput is proposed. To achieve this optimization objective, a unified binary linear programming (UBLP) model is constructed which is then solved by the simplex method and branch-and-bound search. The solution to this model satisfies a bandwidth requirement for each user, e.g., the bandwidth for each user is equal to or larger than a per-user bandwidth minimum, and the solution also maximizes the network throughput. We prove that given different per-user bandwidth minimum, the optimal solution to the UBLP model achieves specific optimization objectives, such as the maximum network throughput and the max-min fairness. For the proportional fairness objective, the solution to the UBLP model proves to be within a bound of the optimal solution.