Sciweavers

298 search results - page 57 / 60
» ideal 2010
Sort
View
TON
2010
163views more  TON 2010»
14 years 8 months ago
Toward practical opportunistic routing with intra-session network coding for mesh networks
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
Bozidar Radunovic, Christos Gkantsidis, Peter B. K...
TPDS
2010
115views more  TPDS 2010»
14 years 8 months ago
Providing QoS with the Deficit Table Scheduler
—A key component for networks with Quality of Service (QoS) support is the egress link scheduling algorithm. An ideal scheduling algorithm implemented in a high-performance netwo...
Raul Martinez-Morais, Francisco J. Alfaro-Cortes, ...
TPDS
2010
109views more  TPDS 2010»
14 years 8 months ago
Distributed Network Formation for n-Way Broadcast Applications
—In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n À 1 destinations as well as download their respecti...
Georgios Smaragdakis, Nikolaos Laoutaris, Pietro M...
TROB
2010
58views more  TROB 2010»
14 years 8 months ago
Localization: Approximation and Performance Bounds to Minimize Travel Distance
Abstract—Localization, which is the determination of one’s location in a known terrain, is a fundamental task for autonomous robots. This paper presents several new basic theor...
Craig A. Tovey, Sven Koenig
WINET
2010
105views more  WINET 2010»
14 years 8 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...