2-Connected Dominating Set inWireless Networks (Invited Talk Abstract)

Summary form only given. Wireless ad hoc networks, including wireless sensor networks, can be flexibly and quickly deployed for many applications, both in military and civil. There is no fixed or predefined infrastructure in these networks. Virtual backbone has been proposed as routing infrastructure to alleviate the broadcasting storm problem as well as to reduce the energy consumption in communication. A virtual backbone can be approximated by a connected dominating set (CDS) of a graph representing a network. The problem of finding a minimum CDS is very challenging due to its hardness. More complicated, since the nodes in the virtual backbone need to carry other nodes traffic and node/link failure are inherent in wireless networks, it is desirable that the CDS is fault tolerant. In this talk, the author presents a novel algorithm to construct a 2-connected dominating set, in which for any pair of nodes, there exists at least 2 disjoint paths