460 search results - page 54 / 92 » Bounding the locality of distributed routing algorithms |
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—Intelligent transportation systems have become increasingly important for the public transportation in Shanghai. In response, ShanghaiGrid (SG) aims to provide abundant intellig...
PDCN
2004
13 years 10 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
SIGMETRICS
2008
ACM
13 years 9 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
COMCOM
1998
13 years 8 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...