Sciweavers

66 search results - page 3 / 14
» Optimal oblivious routing in polynomial time
Sort
View
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 2 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
INFOCOM
2007
IEEE
14 years 2 days ago
Modelling and Optimization of Stochastic Routing for Wireless Multi-Hop Networks
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
Alejandro Ribeiro, Georgios B. Giannakis, Zhi-Quan...
TCOM
2010
116views more  TCOM 2010»
13 years 4 months ago
Optimal Routing for Decode-Forward in Cooperative Wireless Networks
Abstract—We investigate routing in cooperative multipleterminal wireless networks in which the nodes can collaborate with each other in data transmission. First, we motivate coop...
Lawrence Ong, Mehul Motani
SECON
2010
IEEE
13 years 3 months ago
Multi-Constrained Anypath Routing in Wireless Mesh Networks
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...
Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue
ICC
2007
IEEE
14 years 3 days ago
Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network
— 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...
Edwin Soedarmadji, Robert J. McEliece