End-to-end rate allocation in multi-radio wireless mesh networks: cross-layer schemes

Authors:
Jian Tang;Guoliang Xue;Weiyi Zhang
Affiliations:
Arizona State University, Temp, AZ;Arizona State University, Temp, AZ;Arizona State University, Temp, AZ
Venue:
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Year:
2006

Citing 13
Cited 6

Rate allocation in wireless sensor networks with network lifetime requirement

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Convex Optimization

Convex Optimization
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks

ACM SIGMOBILE Mobile Computing and Communications Review
Routing in multi-radio, multi-hop wireless mesh networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Linear Programming and Network Flows

Linear Programming and Network Flows
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Wireless mesh networks: a survey

Computer Networks and ISDN Systems
Capacity of multi-channel wireless networks: impact of number of channels and interfaces

Proceedings of the 11th annual international conference on Mobile computing and networking
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

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
The capacity of wireless networks

IEEE Transactions on Information Theory
Network planning in wireless ad hoc networks: a cross-Layer approach

IEEE Journal on Selected Areas in Communications

Autonomous Transmission Power Adaptation for Multi-Radio Multi-Channel Wireless Mesh Networks

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Channel assignment algorithms: a comparison of graph based heuristics

Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
A load aware channel assignment and link scheduling algorithm for multi-channel multi-radio wireless mesh networks

HiPC'08 Proceedings of the 15th international conference on High performance computing
On-line joint QoS routing and channel assignment in multi-channel multi-radio wireless mesh networks

Computer Communications
On the end-to-end flow allocation and channel assignment in multi-channel multi-radio wireless mesh networks with partially overlapped channels

Computer Communications
Online reconfiguration of channel assignment in Multi-Channel Multi-Radio wireless mesh networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study rate allocation for a set of end-to-end communication sessions in multi-radio wireless mesh networks. We propose cross-layer schemes which can jointly solve rate allocation, channel assignment, routing, scheduling and power control problems in multiple layers. Specifically, a Linear Programming (LP) based scheme is presented to compute end-to-end rate allocation with the goal of maximizing network throughput. As simple throughput maximization may lead to a severe bias on rate allocation, we take fairness into consideration based on a parameter named Demand Satisfaction Factor (DSF), and two fairness models, a simplified max-min fairness model and the well-known proportional fairness model. We propose LP-based and Convex Programming (CP) based schemes to compute fair end-to-end rate allocation. Our schemes can provide upper bounds on achievable network throughput and max-min DSF values. Numerical results show that our proportional fair rate allocation scheme achieves a good tradeoff between throughput and fairness.