A superimposition control construct for distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
ACM Transactions on Algorithms (TALG)
Best-effort group service in dynamic networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Self-stabilization versus robust self-stabilization for clustering in ad-hoc network
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
From self- to self-stabilizing with service guarantee 1-hop weight-based clustering
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We present a fast, local clustering service, FLOC, that partitions a multihop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clusterhead such that all nodes within unit distance and some nodes within distance m of the clusterhead belong to the cluster. We show that, by asserting a stretch factor m \geq 2, FLOC achieves locality of clustering and fault-local self-stabilization: The effects of cluster formation and faults/changes at any part of the network are contained within at most m+1 units. Through simulations and experiments with actual deployments, we analyze the trade-offs between clustering time and the quality of clustering and suggest suitable parameters for FLOC to achieve a fast completion time without compromising the quality of the resulting clustering.