Sciweavers

2497 search results - page 9 / 500
» Requirements for models of achievable routing
Sort
View
TPDS
2008
188views more  TPDS 2008»
15 years 6 months ago
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
Yu Wang 0003, Weizhao Wang, Xiang-Yang Li, Wen-Zha...
ISCAS
2002
IEEE
65views Hardware» more  ISCAS 2002»
15 years 11 months ago
Maximum achievable energy reduction using coding with applications to deep sub-micron buses
: In this work, the problem of the computation of the minimum energy per bit required for communicating through deep sub-micron buses at a given bit rate is solved with an explicit...
Paul-Peter Sotiriadis, Anantha Chandrakasan, Vahid...
ICNP
2005
IEEE
15 years 11 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
WSC
2004
15 years 7 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol
ISPD
1997
ACM
103views Hardware» more  ISPD 1997»
15 years 10 months ago
On two-step routing for FPGAS
We present results which show that a separate global and detailed routing strategy can be competitive with a combined routing process. Under restricted architectural assumptions, ...
Guy G. Lemieux, Stephen Dean Brown, Daniel Vranesi...