Mobile Intelligence

REFERENCES

1. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Math., 86(1–3):165–177, 1990.

2. B. Das, R. Sivakumar, and V. Bhargavan. Routing in ad-hoc networks using a spine, Proceedings of ICCCN'1997, pp. 1–20.

3. J. Wu and F. Dai. A generic distributed broadcast scheme in ad hoc wireless networks, Proceedings of ICDCS'2003, May 2003, pp. 460–468.

4. R. Rajaraman. Topology control and routing in ad hoc networks: a survey, SIGACT News, 33(2):60–73, 2002.

5. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.

6. S. Basagni, M. Mastrogiovanni, and C. Petrioli. A performance comparison of protocols for clustering and backbone formation in large scale ad hoc network, Proceedings of MASS'2004, October 2004, pp. 70–79.

7. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59–68, 1995.

8. D. Blough, M. Leoncini, G. Resta, and P. Santi. The K-neigh protocol for symmetric topology control in ad hoc networks. Proceedings of MobiHoc'2003, June 2003, pp. 141–152.

9. W. Wu, H. Du, X. Jia, Y. Li, S. C.-H. Huang, and D.-Z. Du. Maximal independent set and minimum connected dominating set in unit disk graphs, submitted.

10. S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374–387, 1998.

11. J. Wu and H. Li. On calculating connected dominating set for efficient routing in ...