Fault-tolerant k-fold pivot routing in wireless sensor networks

Proceedings of the Annual Hawaii International Conference on System Sciences

Volumn , Issue , 2008, Pages

  Bein, Doina ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

Cover; Dominating set; Fault tolerance; K fold dominating set; Pivots; Routers; Sensor network; Wireless communication

Indexed keywords

NUCLEAR PROPULSION; SENSOR NETWORKS; WIRELESS SENSOR NETWORKS;

COVER; DOMINATING SET; FAULT TOLERANCE; K-FOLD DOMINATING SET; PIVOTS; ROUTERS; SENSOR NETWORK; WIRELESS COMMUNICATION;

COMPUTER NETWORKS;

EID: 51449094216     PISSN: 15301605     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.2008.170     Document Type: Conference Paper

References (20)

1. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive routing. Symposium on Theory of Computing (STOC), volume 2, pages 230-240, 1989.
2. F. Dai and J. Wu. On constructing k-connected k-dominating set in wireless networks. Proceedings of IEEE International Parallel & Distributed Processing Symposium (IPDPS), April 2005.
3. F. Dai and J. Wu. On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. Journal of Parallel and Distributed Computing, 66(7):947-958, 2006.
4. J. E. Dunbar, J. W. Grossman, J. H. Hattingh, S. T. Hedetniemi, and A. A. McRae. On weakly-connected domination in graphs. Discrete Mathematics, volume 167/168, pages 261-269, 1997.
5. T. Eilam, C. Gavoille, and D. Peleg. Compact routing schemes with low stretch factor. ACM Symposium on Principles of Distributed Computing (PODC), pages 11-20, 1998.
6. C. Glaßer, S. Reith, and H. Vollmer. The complexity of base station positioning in cellular networks. Discrete Applied Mathematics, 148(1):1-12, 2005.
7. I. Jaluta. Index cache consistency in client-server database systems. Sixth IEEE International Conference on Computer and Information Technology (CIT 06), 0:9, 2006.
8. J. Kratochvil. Problems discussed at the workshop on cycles and colourings. univ.science.upsj.sk/c&c/rhistory/cc95prob.htm, 1995.
9. J. Kratochvil, P. Manuel, M. Miller, and A. Proskurowski. Disjoint and fold domination in graphs. Australasian Journal of Combinatorics, 18:277-292, 1998.
10. F. Kuhn, T. Moscibroda, and R. Wattendorf. Fault-tolerant clustering in ad hoc and sensor networks. Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 06), page 68, 2006.
11. S. Kutten and D. Peleg. Fast distributed construction of small k-dominating sets and applications. Journal of Algorithms, pages 40-66, 1998.
12. C. S. Liao and G. J. Change. k-tuple domination in graphs. Information Processing Letters, 87:45-50, 2003.
13. L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
14. Z. Lu and K. S. McKinley. Partial collection replication versus caching for information retrieval systems. Proceedings of the 23rd annual International ACM SIGIR conference on Research and development in information retrieval, pages 248-255, New York, NY, USA, 2000. ACM Press.
15. R. Mathar and T. Niessen. Optimum positioning of base stations for cellular radio networks. Wireless Networks, 6(6):421-428, 2000.
16. D. Peleg. Distributed data structures: a complexity-oriented view. Proceedings of the 4th International Workshop on Distributed Algorithms, pages 71-89, 1990.
17. L. D. Penso and V. C. Barbosa. A distributed algorithm to find k-dominating sets. Discrete Applied Mathematics, 141(1-3):243-253, 2004.
18. V. Vazirani. Approximation Algorithms. Morgan Kaufmann Publishers, Springer, 2001.
19. F. H. Wang, J. M. Chang, Y. L. Wang, and S. J. Huang. Distributed algorithms for finding the unique minimum distance dominating set in split-stars. Journal of Parallel and Distributed Computing, 63:481-487, 2003.
20. R. Wittmann and M. Zitterbart. Multicast Communication: Protocols and Applications. Morgan Kaufmann Publishers, San Francisco, CA, USA, 2001.