Self-Stabilizing Publish/Subscribe Protocol for P2P Networks

Abstract. In this paper, we develop a new self-stabilizing (fault tolerant) protocol for publish/subscribe scheme in a P2P network. We provide a complexity analysis of the recovery (stabilization) time of the protocol after arbitrary failures in the network. The protocol converges in at most n 2 ( ∆ +1)m + n 3 − n time in the worst case where n, m, and ∆ denote respectively the number of nodes, edges, and the maximum degree of a node in the system graph (network). We also propose a a space efficient way to utilize this self-stabilizing publish/subscribe scheme, which allows flexibility in implementations.

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets