Data networks
Theory of linear and integer programming
Theory of linear and integer programming
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop Wireless Networks
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Towards Interference-Aware Routing for Real-time Traffic in Multi-hop Wireless Networks
DS-RT '07 Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications
QoS-aware routing based on bandwidth estimation for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understanding necessary to derive effective distributed protocols. However, the high computational complexity of realistic models restrict the translation of theoretical insights into distributed protocols. In this paper, we consider an NP-hard, Mixed Integer Linear Programming based routing model that computes single-path routes in a wireless network. We propose an efficient, polynomial time algorithm that applies domain specific heuristics to reduce the complexity. We employ a decomposition based approach to break the monolithic problem into several sub-problems that cooperate to find near-optimal routes. The sub-problem structure is chosen such that it captures the optimal route discovery process between a source and destination; this is a design principle that can be directly used in distributed routing protocols. We show that the resulting formulation achieves orders of magnitude improvement in the run-time. Simulation results show that the routes derived from the model are effective even in practical wireless networks with commonly used protocol stack.