Computational geometry: an introduction
Computational geometry: an introduction
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
An architecture for mobile radio networks with dynamically changing topology using virtual subnets
Mobile Networks and Applications - Special issue: mobility management
Multicluster, mobile, multimedia radio network
Wireless Networks
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Lower bounds for kinetic planar subdivisions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Data structures for mobile data
Journal of Algorithms
Mobile facility location (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Bluetooth: vision, goals, and architecture
ACM SIGMOBILE Mobile Computing and Communications Review
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth 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
Algorithmic issues in modeling motion
ACM Computing Surveys (CSUR)
Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Worst case mobility in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Smooth kinetic maintenance of clusters
Proceedings of the nineteenth annual symposium on Computational geometry
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the node-scheduling approach to topology control in ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Node clustering based on link delay in P2P networks
Proceedings of the 2005 ACM symposium on Applied computing
Smooth kinetic maintenance of clusters
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Constant-time distributed dominating set approximation
Distributed Computing
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges
IEEE Transactions on Mobile Computing
Ad hoc networks beyond unit disk graphs
Wireless Networks
Octopus: a fault-tolerant and efficient ad-hoc routing protocol
Wireless Networks
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Smooth kinetic maintenance of clusters
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Algorithms for ad hoc and sensor networks
Computer Communications
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Multi agent Community to support information processing in Wireless Sensor Network applications
International Journal of Intelligent Information and Database Systems
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Distributed approximation algorithms in unit-disk graphs
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Wireless networking: graph theory unplugged
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Connected dominating sets on dynamic geometric graphs
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
\emph{We propose a new randomized algorithm for maintaining a set of c lusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a variable subset of the nodes as cluster centers. This subset has the property that (1) balls of the given radius centered at the chosen nodes cover all the others and (2) the number of centers selected is a constant-factor approximation of the minimum possible. As the nodes move, an event-based kinetic data structure updates the clustering as necessary. This kinetic data structure is shown to be responsive, efficient, local, and compact. The produced cover is also smooth, in the sense that wholesale cluster re-arrangements are avoided. The algorithm can be implemented without exact knowledge of the node positions, if each node is able to sense its distance to other nodes up to the cluster radius. Such a kinetic clustering can be used in numerous applications where mobile devices must be interconnected into an ad-hoc network to collaboratively perform some task.}