Sciweavers

422 search results - page 75 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
INFOCOM
2007
IEEE
16 years 11 days ago
Routing with a Markovian Metric to Promote Local Mixing
— Routing protocols have traditionally been based on finding shortest paths under certain cost metrics. A conventional routing metric models the cost of a path as the sum of the...
Yunnan Wu, Saumitra M. Das, Ranveer Chandra
NCA
2007
IEEE
16 years 10 days ago
Scheduling Bulk File Transfers with Start and End Times
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
Kannan Rajah, Sanjay Ranka, Ye Xia
INFOCOM
2007
IEEE
16 years 11 days ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
BCS
2008
15 years 7 months ago
Adaptive Random Re-Routing for Differentiated QoS in Sensor Networks
Much of the traffic carried by Sensor Networks will originate from routine measurements or observations by sensors which monitor a particular situation, such as the temperature an...
Erol Gelenbe, Edith C. H. Ngai
ADHOC
2007
121views more  ADHOC 2007»
15 years 6 months ago
Power-aware single- and multipath geographic routing in sensor networks
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a signi...
Shibo Wu, K. Selçuk Candan