Engineering Self-Critical Behavior in Mobile Adhoc Networks

The paper describes the application of the theory of self-criticality to the problem of self-organization in mobile ad hoc networks. It specifically addresses the problem of clustering into optimum size groups using only local information available at the nodes, identify clusterheads for the clusters. Self-organized criticality is defined as the ability of a system to evolve in such a way as to approach a critical point and then maintain itself at that point. The algorithm described in this paper enables the clusters to dynamically reconfigure themselves when the topology changes significantly with minimum overhead