Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Networks

@inproceedings{Khan2008DistributedAF,
  title={Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Networks},
  author={Maleq Khan and Gopal Pandurangan and V. S. Anil Kumar},
  year={2008}
}
While there are distributed algorithms for the Minimum Spanning Tree (MST) problem, these algorithms require relatively large number of messages and time, and are fairly involved, making them impractical for resource-constrained networks such as wireless sensor networks. In such networks, a sensor has very limited power, and any algorithm needs to be simple, local, and energy efficient. Motivated by these considerations, we design and analyze a class of simple and local distributed algorithms… CONTINUE READING
6 Citations
27 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Algorithms

  • R. Motwani, P. Raghavan, Randomized
  • 1995
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…