The maximum concurrent flow problem
Journal of the ACM (JACM)
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks
IEEE Transactions on Mobile Computing
Computationally efficient bandwidth allocation and power control for OFDMA
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
Broadband wireless access with WiMax/802.16: current performance benchmarks and future potential
IEEE Communications Magazine
Wireless relays for broadband access [radio communications series]
IEEE Communications Magazine
Resource Allocation for OFDMA Relay Networks With Fairness Constraints
IEEE Journal on Selected Areas in Communications
Interference aware resource allocation for hybrid hierarchical wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new adaptive model for throughput enhancement and optimal relay selection in IEEE 802.16j networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Hi-index | 0.00 |
The wireless relay mesh network (WRMN) is designed to provide robust and fault tolerant communications between relay and user nodes in broadband wireless networks. In this paper, we study interference aware resource allocation in OFDMA based WRMNs and the effects of spatial reuse on throughput. We propose an interference aware subcarrier assignment (IASA) algorithm to allocate subcarriers to links in the network such that interference is mitigated and throughput is maximized. The protocol interference model and spatial reuse are exploited to achieve the subcarrier assignment. We show that our IASA algorithm improves throughput compared to when subcarriers are used only once. However, overuse of a single subcarrier can have detrimental effects on network performance, therefore a balance must be achieved. In addition, using a maximum concurrent flow (MCF) approach, we show that under the IASA scheme of spatial reuse, throughput can be enhanced. We formulate the MCF as a linear program and solve it using dual optimization techniques. We compare our proposed algorithm with that of a graph coloring approach using a conflict graph and column generation to show that our throughput results are better than those obtained by the link coloring strategy.