126 search results - page 2 / 26 » Optimal Routing in the Worst-Case-Error Metric |
ICC
2007
IEEE
14 years 19 days 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...
ISCAS
1995
IEEE
13 years 10 months ago
1995
IEEE
We present a novel technique for datapath allocation, which incorporates interconnection area and delay estimates based on dynamic oorplanning. In this approach, datapath area is ...
EJWCN
2010
13 years 1 months ago
2010
Simulation studies have been the predominant method of evaluating ad hoc routing algorithms. Despite their wide use and merits, simulations are generally time consuming. Furthermo...
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
TON
2010
13 years 4 months ago
2010
—Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and netwo...