45 search results - page 2 / 9 » Polynomial time approximation algorithms for multi-constrain... |
SECON
2010
IEEE
13 years 2 months ago
2010
IEEE
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
ICC
2011
IEEE
12 years 4 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
MOBIHOC
2005
ACM
14 years 4 months ago
2005
ACM
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...