Trust-region methods
A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
An on-demand minimum energy routing protocol for a wireless ad hoc network
ACM SIGMOBILE Mobile Computing and Communications Review
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial 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
A Multi-Radio Unification Protocol for IEEE 802.11 Wireless Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
On outer bounds to the capacity region of wireless networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A high-throughput path metric for multi-hop wireless routing
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Asymptotic Capacity of Infrastructure Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Congestion-Aware Clique-Based Handoff in Wireless Mesh Networks
MSN '09 Proceedings of the 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
Capacity region of a wireless mesh backhaul network over the CSMA/CA MAC
INFOCOM'10 Proceedings of the 29th conference on Information communications
Breathe to stay cool: adjusting cell sizes to reduce energy consumption
Proceedings of the first ACM SIGCOMM workshop on Green networking
FloorNet: deployment and evaluation of a multihop wireless 802.11 testbed
EURASIP Journal on Wireless Communications and Networking - Special issue on simulators and experimental testbeds design and development for wireless networks
Basis reduction and the complexity of branch-and-bound
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Capacity regions for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Upper bounds to transport capacity of wireless networks
IEEE Transactions on Information Theory
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Capacity of ad hoc wireless networks with infrastructure support
IEEE Journal on Selected Areas in Communications
Quality-Aware Routing Metrics for Time-Varying Wireless Mesh Networks
IEEE Journal on Selected Areas in Communications
A green framework for energy efficient management in TDMA-based wireless mesh networks
Proceedings of the 8th International Conference on Network and Service Management
Energy efficient management framework for multihop TDMA-based wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.24 |
In this paper we propose a novel routing algorithm for 802.11 based wireless mesh networks called Energy and Throughput-aware Routing (ETR). The design objectives of ETR are (i) to provide flows with throughput guarantees, and (ii) to minimize the overall energy consumption in the mesh network. To achieve these objectives, we first analyze the throughput performance of the mesh network. Based on this analysis, we target obtaining the set of feasible allocations in the wireless network, i.e., the capacity region, which results in a set of complex non-linear equations that are not adequate for optimization algorithms. To overcome this computational complexity we derive a set of linear constraints (referred to as linearized capacity regions) which provides a much simpler formulation at a slightly reduced accuracy. By feeding these linear constraints into an integer programming formulation, we then propose a routing algorithm that admits as many flows as possible while satisfying their throughput guarantees. This algorithm is further extended to account for energy considerations by devising a routing algorithm that uses as few nodes as possible, which allows switching off the unused nodes and thus save energy. The proposed approach is thoroughly evaluated and shown to outperform previous approaches very substantially both in terms of throughput and energy consumption.