Minimization methods for non-differentiable functions
Minimization methods for non-differentiable functions
Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Convex Optimization
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Adaptive network coding and scheduling for maximizing throughput in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A simple local-control approximation algorithm for multicommodity flow
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Cross-layer optimization for wireless multihop networks with pairwise intersession network coding
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Pairwise intersession network coding on directed networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Insufficiency of linear coding in network information flow
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we investigate optimal cross-layer design of congestion control, routing, one-hop two-way inter-commodity (OTIC) network coding and scheduling in wireless multi-hop networks utilizing the broadcast advantage of wireless medium. We first present an achievable rate region with OTIC network coding by introducing virtual flow rates in a node. Then we formulate the network utility maximization problem subject to constraints on this achievable rate region, and analyze the complexities of both node- and path-based formulation with no network coding, OTIC network coding, and overhearing network coding. After that, we solve it using dual decomposition and subgradient method. Based on the solution, we present a new queue model, which is able to facilitate the coding operation between two-way commodities, and then propose a backpressure-based cross-layer optimization algorithm with low coding complexity and overhead. Afterwards, we analyze the stability and asymptotical optimality of the proposed cross-layer algorithm by Lyapunov drift technique, and evaluate its performance through extensive simulation. By comparing with the pure routing scheme under both primary and two-hop interference models in an illustrative topology, it is shown that with the proposed joint optimization algorithms, the OTIC network coding can interact adaptively and optimally with other components in different layers and achieve high throughput gain. Simulation of the proposed algorithm in a mesh network with base station and a random ad hoc network justifies that OTIC network coding can obtain considerable throughput gain with low complexity in various kinds of networks.