Clustering algorithms for wireless ad hoc networks
Authors:
Open Access
- 1 August 2000
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 54-63
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Max-min d-cluster formation in wireless ad hoc networks2002
- On calculating connected dominating set for efficient routing in ad hoc wireless networks1999
- Approximation algorithms for facility location problems (extended abstract)1997
- Multicluster, mobile, multimedia radio networkWireless Networks, 1995
- Election in asynchronous complete networks with intermittent link failuresIEEE Transactions on Computers, 1994
- Leader election in complete networks1992
- Fault-tolerant distributed algorithm for election in complete networksIEEE Transactions on Computers, 1988
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952