Sciweavers

445 search results - page 24 / 89
» Maximizable Routing Metrics
Sort
View
SLIP
2003
ACM
15 years 2 months ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
89
Voted
MOBIHOC
2008
ACM
15 years 9 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
SPAA
2003
ACM
15 years 2 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
NETWORK
2007
144views more  NETWORK 2007»
14 years 9 months ago
A Survey of Routing Protocols that Support QoS in Mobile Ad Hoc Networks
The explosive growth in the use of mobile devices coupled with users’ desires for real-time applications has provided new challenges in the design of protocols for mobile ad hoc...
Lei Chen, Wendi B. Heinzelman
GLOBECOM
2010
IEEE
14 years 7 months ago
Throughput and Energy Efficiency of Opportunistic Routing with Type-I HARQ in Linear Multihop Networks
Opportunistic routing is a well-known technique that exploits the broadcast nature of wireless transmissions and path diversity to form the route in an adaptive manner based on cur...
Davide Chiarotto, Osvaldo Simeone, Michele Zorzi