The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks
ACM SIGMOBILE Mobile Computing and Communications Review
How to correctly use the protocol interference model for multi-hop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Routing exploiting multiple heterogeneous wireless interfaces: A TCP performance study
Computer Communications
Journal of Network and Computer Applications
Dynamic Link Quality Aware Routing Protocol for Multi-radio Wireless Mesh Networks
AINA '12 Proceedings of the 2012 IEEE 26th International Conference on Advanced Information Networking and Applications
Joint scheduling and routing algorithm with load balancing in wireless mesh network
Computers and Electrical Engineering
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
| Hi-index | 0.00 |
In multi-radio multi-channel wireless mesh networks, engineering the network capacity requires a complex cross-layer design. In this paper, in order to make the complex problem implementable in a distributed manner, we make a decoupling approach that breaks down the entire design space into routing and initial channel assignment, and distributed congestion control and local channel reassignment. We propose a unified priced-based framework for distributed congestion control and localized channel-link assignment algorithms. We demonstrate the convergence of the proposed algorithms with respect to different fairness objectives (i.e., proportional fairness and max-min fairness) via simulation on both grid and random topologies. The proposed algorithms achieve faster convergence with less overhead in the control and forwarding plane than previous multi-path based algorithms.