Sciweavers

1950 search results - page 218 / 390
» Two Abstractions for Distributed Systems of Mobile Nodes
Sort
View
BDA
2007
15 years 8 months ago
PeerSum: Summary Management in P2P Systems
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
MOBIHOC
2002
ACM
16 years 6 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
SSD
2005
Springer
150views Database» more  SSD 2005»
15 years 12 months ago
Opportunistic Data Dissemination in Mobile Peer-to-Peer Networks
In this paper we examine the dissemination of availability reports about resources in mobile peer-to-peer networks, where moving objects communicate with each other via short-range...
A. Prasad Sistla, Ouri Wolfson, Bo Xu
RTAS
2003
IEEE
15 years 11 months ago
Real-Time Support for Mobile Robotics
Coordinated behavior of mobile robots is an important emerging application area. Different coordinated behaviors can be achieved by assigning sets of control tasks, or strategies,...
Huan Li, John Sweeney, Krithi Ramamritham, Roderic...
IFM
2009
Springer
158views Formal Methods» more  IFM 2009»
16 years 1 months ago
Developing Topology Discovery in Event-B
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
Thai Son Hoang, Hironobu Kuruma, David A. Basin, J...