Convex Optimization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Weighted coloring based channel assignment for WLANs
ACM SIGMOBILE Mobile Computing and Communications Review
Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks
ACM SIGMOBILE Mobile Computing and Communications Review
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
Queueing Systems: Theory and Applications
Comparison of Multichannel MAC Protocols
IEEE Transactions on Mobile Computing
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
IEEE Transactions on Mobile Computing
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
Joint Throughput Optimization for Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Multiradio Channel Allocation in Multihop Wireless Networks
IEEE Transactions on Mobile Computing
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Channel assignment is a challenging issue for multi-radio multi-channel wireless networks, especially in a competing environment. This paper investigates channel assignment for selfish nodes in a heterogeneous scenario, in which nodes may have different QoS requirements and thus compete for different channels with unequal bandwidth. The interaction among nodes is formulated as a non-cooperative Multi-radio Channel Assignment Game (MCAG), where Nash Equilibrium (NE) corresponds to a stable channel assignment outcome from which no individual node has the incentive to deviate. The NEs in MCAG are characterized in this paper. Since multiple NEs may exist in this game, it is natural to choose the NE that maximizes the network utility, i.e., the sum of node utilities. It is shown that the optimal NE outcome can be derived by solving an integer non-linear programming problem. Based on some observations on the radio number distribution of NE, we propose a two-stage optimization algorithm to achieve an optimal channel assignment. Finally, computer simulations validate the effectiveness of the proposed algorithm.