Sciweavers

10 search results - page 2 / 2
» On the power of lookahead in on-line server routing problems
Sort
View
EDBT
1994
ACM
117views Database» more  EDBT 1994»
13 years 10 months ago
Content Routing for Distributed Information Servers
We describe a system that provides query based associative access to the contents of distributed information servers. In typical distributed information systems there are so many o...
Mark A. Sheldon, Andrzej Duda, Ron Weiss, James O'...
MSWIM
2005
ACM
13 years 11 months ago
Randomized energy aware routing algorithms in mobile ad hoc networks
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
Israat Tanzeena Haque, Chadi Assi, J. William Atwo...
MOBIHOC
2005
ACM
14 years 5 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
13 years 11 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
SENSYS
2006
ACM
14 years 6 hour ago
Interest dissemination with directional antennas for wireless sensor networks with mobile sinks
Introducing mobile data sinks into wireless sensor networks (WSNs) improves the energy efficiency and the network lifetime, and is demanded for many application scenarios, such a...
Yihong Wu, Lin Zhang, Yiqun Wu, Zhisheng Niu