Showing papers by "Saurabh Srivastava published in 2003"
TL;DR: This paper proposes 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 and provides a distributed algorithms for finding k-core of that spanning tree.
16 citations
20 Mar 2003
TL;DR: This work considers the problem of allocating variable length orthogonal codes in an ad hoc network based on CDMA, and presents a simple distributed code allocation protocol based on the greedy approximation.
Abstract: We consider here the problem of allocating variable length orthogonal codes in an ad hoc network based on CDMA. We consider a snapshot version of the problem at some instant. It had been proved earlier than even for a static set of communications and topology the problem is intractable. A greedy algorithm is stated to provide a bounded approximation to the throughput maximizing optimal allocation. We present a simple distributed code allocation protocol based on the greedy approximation. Simulation experiments show the enhanced throughput obtained by our protocol as compared to other code allocation schemes.
9 citations