711 search results - page 86 / 143 » Distributed Energy-conserving Routing Protocols |
EUC
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algor...
109
click to vote
TMC
2008
15 years 1 months ago
2008
Content-based routing (CBR) provides a powerful and flexible foundation for distributed applications. Its communication model, based on implicit addressing, fosters decoupling amon...
133
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
150
click to vote
WWW
2003
ACM
16 years 2 months ago
2003
ACM
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
123
click to vote
MOBICOM
2003
ACM
15 years 6 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...