Incremental construction of κ-dominating sets in wireless sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4305 LNCS, Issue , 2006, Pages 202-214

  Couture, Mathieu ^a   Barbeau, Michel ^a   Bose, Prosenjit ^a   Kranakis, Evangelos ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Distributed algorithms; Dominating set; Fault tolerance; Maximal independent set; Unit disk graph

Indexed keywords

APPROXIMATION ALGORITHMS; DISTRIBUTED DATABASE SYSTEMS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH ALGORITHMS; GRAPH THEORY; PARALLEL ALGORITHMS;

A-MONOTONE; DOMINATING SETS; GRAPH G; INCREMENTAL CONSTRUCTION; MAXIMAL INDEPENDENT SET; UNIT DISK GRAPHS;

WIRELESS SENSOR NETWORKS;

EID: 84872075814     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11945529_15     Document Type: Conference Paper

References (13)

1. K. M. Alzoubi, P.-J. Wan, and O. Frieder, Message-optimal connected dominating sets in mobile ad hoc networks. In MobiHoc '02: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, pp. 157-164, ACM Press, New York, NY, USA, 2002.
2. M. Couture, M. Barbeau, P. Bose, and E. Kranakis, Incremental construction of k-dominating sets in wireless sensor networks. Tech. Rep. TR-06-11, School of Computer Science, Carleton University, Ottawa, Ontario, Canada, 2006.
3. F. Dai and J. Wu, On constructing k-connected k-dominating set in wireless networks. In IPDPS, IEEE Computer Society, 2005.
4. D. S. Johnson, Approximation algorithms for combinatorial problems. In STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing, pp. 38-49, ACM Press, New York, NY, USA, 1973.
5. F. Kuhn, The Price of Locality: Exploring the Complexity of Distributed Coordination Primitives. In PhD Thesis, ETH Zurich, Diss. ETH No. 16213, 2005.
6. F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be computed locally! In PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 300-309, ACM Press, New York, NY, USA, 2004.
7. F. Kuhn, T. Moscibroda, and R. Wattenhofer, On the locality of bounded growth. In PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pp. 60-68, ACM Press, New York, NY, USA, 2005.
8. F. Kuhn, T. Moscibroda, and R. Wattenhofer, Fault-Tolerant Clustering in Ad Hoc and Sensor Networks. In 26th International Conference on Distributed Computing Systems (ICDCS), Lisboa, Portugal, 2006.
9. M. Marathe, H. Breu, S. Ravi, and D. Rosenkrantz, Simple heuristics for unit disk graphs. Networks, 25:59-68, 1995.
10. M. D. Penrose, The longest edge of the random minimal spanning tree. The Annals of Applied Probability, 7(2):340-361, 1997.
11. M. D. Penrose, On k-connectivity for a geometric random graph. Random Struct. Algorithms, 15(2):145-164, 1999.
12. I. Stojmenovic, M. Seddigh, and J. Zunic, Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distrib. Syst., 13(1):14-25, 2002.
13. P.-J. Wan, K. M. Alzoubi, and O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks. Mob. Netw. Appl., 9(2):141-149, 2004.