Strongly connected dominating sets in wireless sensor networks with unidirectional links

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

Volumn 3841 LNCS, Issue , 2006, Pages 13-24

  Du, Ding Zhu ^a   Thai, My T ^a   Li, Yingshu ^b   Liu, Dan ^a   Zhu, Shiwei ^a  

^a University of Minnesota   (United States)

^b GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Directed Graph; Disk Graph; Strongly Connected Dominating Set; Virtual Backbone; Wireless Sensor Network

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING; SENSORS; TELECOMMUNICATION LINKS; TOPOLOGY; VIRTUAL REALITY;

DIRECTED GRAPH; DISK GRAPH; STRONGLY CONNECTED DOMINATING SET (SCDS); VIRTUAL BACKBONE; WIRELESS SENSOR NETWORK;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33745652953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11610113_2     Document Type: Conference Paper

References (10)

1. M. T. Thai, F. Wang, D. Liu, S. Zhu, and D.-Z. Du, "Connected Dominating Sets in Wireless Networks with Different Transmission Ranges", Manuscript, 2005.
2. Y. Li, S. Zhu, M. T. Thai, and D.-Z. Du, "Localized Construction of Connected Dominating Set in Wireless Networks", NSF International Workshop on Thoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks, 2004.
3. P.-J. Wan, K. M. Alzoubi, and O. Frieder, "Distributed Construction on Connected Dominating Set in Wireless Ad Hoc Networks", Proceedings of the Conference of the IEEE Communications Society (INFOCOM), 2002.
4. Y. Li, M. T. Thai, F. Wang, C.-W. Yi, P.-J. Wang, and D.-Z. Du, "On Greedy Construction of Connected Dominating Sets in Wireless Networks", Special issue of Wireless Communications and Mobile Computing (WCMC), 2005.
5. M. Cardei, M.X. Cheng, X. Cheng, and D.-Z. Du, "Connected Domination in Ad Hoc Wireless Networks", Proceedings of the Sixth International Conference on Computer Science and Informatics (CSI), 2002.
6. S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets", Algorithmica, vol. 20, pp. 374-387, 1998
7. L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and L.-I. Ko, "A Greedy Approximation for Minimum Connected Dominating Sets", Theoretical Computer Science, 2005. To appear
8. J. Wu and H. Li, "On Calculating Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks", Proceedings of the Third International Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., 1999.
9. K.M. Alzoubi, P.-J. Wang, and O. Frieder, "Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks", Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), 2002.
10. F. Dai and J. Wu, "An Extended Localized Algorithms for Connected Dominating Set Formation in Ad Hoc Wireless Networks", IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 10, October 2004