The GBAR source model for VBR videoconferences
IEEE/ACM Transactions on Networking (TON)
An Introduction to Genetic Algorithms
An Introduction to Genetic Algorithms
Distributed medium access control for wireless mesh networks: Research Articles
Wireless Communications & Mobile Computing - Medium Access Control Protocols for Wireless Ad Hoc Networks
IEEE Transactions on Wireless Communications
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
IEEE Transactions on Wireless Communications
Efficient subcarrier, power, and rate allocation with fairness consideration for OFDMA uplink
IEEE Transactions on Wireless Communications - Part 1
Low complexity subcarrier and power allocation for utility maximization in uplink OFDMA systems
IEEE Transactions on Wireless Communications - Part 1
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
Joint Power-Frequency-Time Resource Allocation in Clustered Wireless Mesh Networks
IEEE Network: The Magazine of Global Internetworking
IEEE Transactions on Wireless Communications
A multipacket reception protocol based on cooperative communication for WMNs
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Mobile Networks and Applications
Resource Allocation in High Data Rate Mesh WPAN: A Survey Paper
Wireless Personal Communications: An International Journal
Hi-index | 0.01 |
Joint power-subcarrier-time resource allocation is imperative for wireless mesh networks due to the necessity of packet scheduling for quality-of-service (QoS) provisioning, multi-channel communications, and opportunistic power allocation. In this work, we propose an efficient intra-cluster packet-level resource allocation approach. Our approach takes power allocation, subcarrier allocation, packet scheduling, and QoS support into account. The proposed approach combines the merits of a Karush-Kuhn-Tucker (KKT)-driven approach and a genetic algorithm (GA)-based approach. It is shown to achieve a desired balance between time complexity and system performance. Bounds for the throughputs obtained by real-time and non-real-time traffic are also derived analytically.