Multi-hop scatternet formation and routing for large scale Bluetooth networks
International Journal of Ad Hoc and Ubiquitous Computing
A distributed algorithm for energy-aware clustering in WSN
International Journal of Sensor Networks
Thwarting inside jamming attacks on wireless broadcast communications
Proceedings of the fourth ACM conference on Wireless network security
Self-stabilizing algorithm for maximal graph partitioning into triangles
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
| Hi-index | 0.00 |
Self-stabilization is a theoretical framework of nonmasking fault-tolerant algorithms in distributed systems. In this paper, we consider a problem to find fully connected subgraphs (cliques) in a network. In our problem setting, each process P in a network G is given a set of its neighbor processes as input, and must find a set of neighbors that are fully connected together with P. As constraints on solutions which make the problem non-trivial, each processmust compute larger cliques as possible, and a process Pj in a clique that a process Pi computes must agree on the result, i.e., the same clique must be obtained by Pj. We present a self-stabilizing algorithm to find cliques, and show its correctness and performance.