Complexity of network synchronization
Journal of the ACM (JACM)
Weighted distributed match-making (preliminary version)
VLSI Algorithms and Architectures
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
New models and algorithms for future networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Towards a universal directory service
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Low-Diameter Graph Decomposition is in NC
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Network synchronization with polylogarithmic overhead
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Efficient solutions to multicast routing in communication networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
StratOSphere: mobile processing of distributed objects in Java
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Optimal location management algorithms for mobile networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A tale of two directories: implementing distributed shared objects in Java
JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
Fundamental control algorithms in mobile networks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Mobility and Extensibility in the StratOSphere Framework
Distributed and Parallel Databases - Special issue on mobile data management and applications
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A data tracking scheme for general networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Managing Mobility of Users in a Virtual Network
Multimedia Tools and Applications
Locating Objects in Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Local Distributed Agent Matchmaking
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Centralized broadcast in multihop radio networks
Journal of Algorithms
Distributed algorithm engineering
Experimental algorithmics
Competitive on-line paging strategies for mobile users under delay constraints
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Advances in Engineering Software
LLS: a locality aware location service for mobile ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
MLS: an efficient location service for mobile ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Trail: A distance-sensitive sensor network service for distributed object tracking
ACM Transactions on Sensor Networks (TOSN)
Predictive QoS routing to mobile sinks in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Trail: a distance sensitive WSN service for distributed object tracking
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
A pursuer-evader game for sensor networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Distributed caching algorithms for content distribution networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Directed spanners via flow-based linear programs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A hierarchy-based fault-local stabilizing algorithm for tracking in sensor networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Online distributed object migration
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Centrality-based power control for hot-spot mitigation in multi-hop wireless networks
Computer Communications
Paging mobile users in cellular networks: Optimality versus complexity and simplicity
Theoretical Computer Science
A scalable framework for mobile real-time group communication services
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
This paper deals with the problem of maintaining a distributed directory server, that enables us to keep track of mobile users in a distributed network. The paper introduces the graph-theoretic concept of regional matching, and demonstrates how finding a regional matching with certain parameters enables efficient tracking. The communication overhead of our tracking mechanism is within a polylogarithmic factor of the lower bound.