Sciweavers

258 search results - page 18 / 52
» Non-cooperative routing in loss networks
Sort
View
PET
2009
Springer
14 years 2 months ago
Scalable Link-Based Relay Selection for Anonymous Routing
The performance of an anonymous path can be described using many network metrics – e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have ...
Micah Sherr, Matt Blaze, Boon Thau Loo
TPDS
2010
222views more  TPDS 2010»
13 years 6 months ago
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
Haibo Zhang, Hong Shen
MOBICOM
2003
ACM
14 years 28 days ago
A high-throughput path metric for multi-hop wireless routing
This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of pac...
Douglas S. J. De Couto, Daniel Aguayo, John C. Bic...
NAS
2010
IEEE
13 years 6 months ago
Efficient Route Discovery Algorithm for MANETs
Blocking-ERS is an energy efficient route discovery algorithm for MANETs. It uses chase packets to improve the route request process. In Blocking-ERS, most of the time the fulfill...
Mznah Al-Rodhaan, Abdullah Al-Dhelaan
GLOBECOM
2009
IEEE
14 years 2 months ago
REPARE: Regenerator Placement and Routing Establishment in Translucent Networks
—Most research works in routing and design of optical networks assume that the optical medium can carry data signals without any bit error. However, physical impairments of the o...
Weiyi Zhang, Jian Tang, Kendall E. Nygard, Chongga...