Sciweavers

4037 search results - page 99 / 808
» Routing without ordering
Sort
View
ICDCS
1998
IEEE
14 years 1 months ago
A Feedback Based Scheme for Improving TCP Performance in Ad-Hoc Wireless Networks
Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other communication support facilities (such as base stations). The topo...
Kartik Chandran, Sudarshan Raghunathan, S. Venkate...
JCT
1998
99views more  JCT 1998»
13 years 8 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
MOR
2008
53views more  MOR 2008»
13 years 9 months ago
Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times
We consider a queue with renewal arrivals and n exponential servers in the Halfin-Whitt heavy traffic regime, where n and the arrival rate increase without bound, so that a critic...
Rami Atar, Adam Shwartz
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 3 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
ADHOCNOW
2008
Springer
14 years 3 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...