Distributed Algorithms to Form Cluster Based Spanning Trees in Wireless Sensor Networks
Authors:
Open Access
- 1 January 2008
- book chapter
- Published by Springer Nature
- p. 519-528
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Distributed Backbone Formation Algorithm for Mobile Ad Hoc Networks2006
- A survey of clustering schemes for mobile ad hoc networksIEEE Communications Surveys & Tutorials, 2005
- HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networksIEEE Transactions on Mobile Computing, 2004
- Wireless sensor networks for habitat monitoring2002
- A two-tier data dissemination model for large-scale wireless sensor networks2002
- Wireless sensor networks: a surveyComputer Networks, 2002
- Geography-informed energy conservation for Ad Hoc routing2001
- Next century challenges1999
- Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems1987
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983