Construction of strongly connected dominating sets in asymmetric multihop wireless networks

  • Authors:

  • Deying Li;Hongwei Du;Peng-Jun Wan;Xiaofeng Gao;Zhao Zhang;Weili Wu

  • Affiliations:

  • Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China), MOE, PR China and School of Information, Renmin University of China, Beijing 100872, PR China;Department of Computer Science, City University of Hong Kong, Kowloon Tang, Hong Kong;Department of Computer Science, Illinois University of Technology, Chicago, IL 60616, USA;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;College of Mathematics and System Sciences, Xinjiang University, Urumqi, PR China;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 5.23

Visualization

Abstract

Consider an asymmetric wireless network represented by a digraph G=(V,E). A subset of vertices U is called a strongly connected dominating set (SCDS) if the subgraph induced by U is strongly connected and every vertex not in U has both an in-neighbor in U and an out-neighbor in U. SCDS plays an important role of the virtual backbone in asymmetric wireless networks. Motivated by the construction of a small virtual backbone, we study the problem Minimum SCDS, which seeks a smallest SCDS of a digraph. For any constant 0