Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
QoS Routing in Ad Hoc Wireless Networks
LCN '98 Proceedings of the 23rd Annual IEEE Conference on Local Computer Networks
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Modeling media access in embedded two-flow topologies of multi-hop wireless networks
Proceedings of the 11th annual international conference on Mobile computing and networking
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
Decomposition for low-complexity near-optimal routing in multi-hop wireless networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 0.00 |
We formulate the real-time routing problem in static multi-hop wireless networks as an optimization problem, whose solution is the optimal routes relative to an end-to-end delay based objective. The problem is formulated as a mixed integer linear program. The variance of the delay with respect to the aggregate interference measures is empirically studied and a linear approximation is proposed. We show that this formulation yields routes that significantly outperform the best routes obtained by OLSR. Finally, we discuss the applications of such a model both in terms of capacity analysis, on-line algorithms for static scenarios, and extensions to allow the development of distributed protocols that solve the optimization problem.