866 search results - page 120 / 174 » On Dynamic Shortest Paths Problems |
SECON
2008
IEEE
14 years 4 months ago
2008
IEEE
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...
INFOCOM
2005
IEEE
14 years 3 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
SECON
2007
IEEE
14 years 4 months ago
2007
IEEE
—Mobile ad hoc networks (MANETs) are a critical technology in filling the gap where the network infrastructure is insufficient or does not exist at all. The dynamic topology of...
SIGMETRICS
2011
ACM
13 years 15 days ago
2011
ACM
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...