[BOOK][B] Distributed computing: a locality-sensitive approach

D Peleg - 2000 - SIAM
Distributed computing concerns environments in which many processors, located at different
sites, must operate in a noninterfering and cooperative manner. Each of the processors …

Energy-efficient neighbor discovery in mobile ad hoc and wireless sensor networks: A survey

W Sun, Z Yang, X Zhang, Y Liu - … Communications Surveys & …, 2014 - ieeexplore.ieee.org
Due to slow advance in battery technology, power remains a bottleneck to limit wide
applications of mobile ad hoc and wireless sensor networks. Among all extensive studies on …

Viewstamped replication: A new primary copy method to support highly-available distributed systems

BM Oki, BH Liskov - Proceedings of the seventh annual ACM …, 1988 - dl.acm.org
One of the potential benefits of distributed systems is their use in providing highly-available
services that are likely to be usable when needed. Availabilay is achieved through …

[PDF][PDF] Accessing nearby copies of replicated objects in a distributed environment

CG Plaxton, R Rajaraman, AW Richa - Proceedings of the ninth annual …, 1997 - dl.acm.org
Consider a set of shared objects in a distributed network, where several copies of each
object may exist at any given time. To ensure both fast access to the objects as well as …

Method and apparatus for internet-based human network brokering

JD Work - US Patent 7,725,525, 2010 - Google Patents
Matches between search queries and potential targets of such search queries are
automatically brokered by (i) comparing search criteria specified in the search queries with …

The landmark hierarchy: a new hierarchy for routing in very large networks

PF Tsuchiya - ACM SIGCOMM Computer Communication Review, 1988 - dl.acm.org
Landmark Routing is a set of algorithms for routing in communications networks of arbitrary
size. Landmark Routing is based on a new type of hierarchy, the Landmark Hierarchy. The …

Mobile users: To update or not to update?

A Bar-Noy, I Kessler, M Sidi - Wireless Networks, 1995 - Springer
Tracking strategies for mobile users in wireless networks are studied. In order to save the
cost of using the wireless links mobile users should not update their location whenever they …

Sparse partitions

B Awerbuch, D Peleg - Proceedings [1990] 31st Annual …, 1990 - ieeexplore.ieee.org
A collection of clustering and decomposition techniques that make possible the construction
of sparse and locality-preserving representations for arbitrary networks is presented. The …

[BOOK][B] Computer science handbook

AB Tucker - 2004 - taylorfrancis.com
When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …

Ad hoc mobility management with uniform quorum systems

ZJ Haas, B Liang - IEEE/ACM Transactions on networking, 1999 - ieeexplore.ieee.org
A distributed mobility management scheme using a class of uniform quorum systems (UQS)
is proposed for ad hoc networks. In the proposed scheme, location databases are stored in …