Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links

• Published in: Frontiers of WWW Research and Development - APWeb 2006 pp. 13 - 24
• Main Authors: Du, Ding-Zhu, Thai, My T., Li, Yingshu, Liu, Dan, Zhu, Shiwei
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2006
• Series: Lecture Notes in Computer Science
• Subjects: Directed Graph; Disk Graph; Strongly Connected Dominating Set; Virtual Backbone; Wireless Sensor Network
• ISBN: 3540311424; 9783540311423
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/11610113_2

A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor networks. With the help of CDS, routing is easier and can adapt quickly to network topology changes. The CDS problem has been studied extensively in undirected graphs, especially in unit disk graphs, in which each sensor node has the same transmission range. However, in practice, the transmission ranges of all nodes are not necessarily to be equal. In this paper, we model a network as a disk graph where unidirectional links are considered and introduce the Strongly Connected Dominating Set (SCDS) problem in disk graphs. We propose two constant approximation algorithms for the SCDS problem and compare their performances through the theoretical analysis.