425 search results - page 52 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In a multi-hop mobile ad hoc network (MANET) mobile nodes communicate with each other forming a cooperative radio network. Security remains a major challenge for these networks du...
HPDC
2003
IEEE
14 years 27 days ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Wireless sensor networks have recently been suggested for many surveillance applications such as object monitoring, path protection, or area coverage. Since the sensors themselves...
ICNP
2006
IEEE
14 years 1 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...