19 research outputs found
Computing for science, engineering and society: Challenges, requirement, and strategic roadmap
A distributed clustering framework in mobile ad hoc networks
In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amount of computational and information overhead while maintaining a stable duster formation. The algorithm is a distributed version of the Basic Leader-Follower Algorithm used in pattern recognition. Our algorithm does not require maintaining a cluster head. The parameters of the algorithm give us 'good' control over the duster properties
Algorithms for Constructing Hierarchical Graphs
An algorithm is described for developing a hierarchy among
a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer
Algorithms for Constructing Hierarchical Graphs
An algorithm is described for developing a hierarchy among
a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer