Distributed algorithms for finding and maintaining a k-tree core in a dynamic network

Authors:
Saurabh Srivastava;R. K. Ghosh
Affiliations:
Department of Computer Science and Engineering Indian Institute of Technology, Kanpur 208016, India;Department of Computer Science and Engineering Indian Institute of Technology, Kanpur 208016, India
Venue:
Information Processing Letters
Year:
2003

Citing 3
Cited 4

Algorithms for a core and k-tree core of a tree

Journal of Algorithms
Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network

ICPP '97 Proceedings of the international Conference on Parallel Processing
Load balanced routing protocols for ad hoc mobile wireless networks

IEEE Communications Magazine

Dense cluster gateway based routing protocol for multi-hop mobile ad hoc networks

Ad Hoc Networks
A route-aware MAC for wireless multihop networks with a convergecast traffic pattern

Computer Networks: The International Journal of Computer and Telecommunications Networking
A merging clustering algorithm for mobile ad hoc networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
A distributed algorithm for a b-coloring of a graph

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

A k-core Ck of a tree T is subtree with exactly k leaves for k ≤ nl, where nl the number of leaves in T, and minimizes the sum of the distances of all nodes from Ck. In this paper first we propose a distributed algorithm for constructing a rooted spanning tree of a dynamic graph such that root of the tree is located near the center of the graph. Then we provide a distributed algorithm for finding k-core of that spanning tree. The spanning tree is constructed in two stages. In the first stage, a forest of trees is generated. In the next stage these trees are connected to form a single rooted tree. An interesting aspect of the first stage of proposed spanning algorithm is that it implicitly constructs the (convex) hull of those nodes which are not already included in the spanning forest. The process is repeated till all non root nodes of the graph have chosen a unique parent. We implemented the algorithms for finding spanning tree and its k-core. A core can be quite useful for routing messages in a dynamic network consisting of a set of mobile devices.