On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks (Q2658460)

Summary: In a wireless ad hoc network, the size of the virtual backbone (VB) is an important factor for measuring the quality of the VB. The smaller the VB is, the less the overhead caused by the VB. Since ball graphs (BGs) have been used to model 3-dimensional wireless ad hoc networks and since a connected dominating set can be used to represent a VB undertaking routing-related tasks, the problem of finding the smallest VB is transformed into the problem of finding a minimum connected dominating set (MCDS). Many research results on the MCDS problem have been obtained for unit disk graphs and unit ball graphs, in which the transmission ranges of all nodes are identical. In some situations, the node powers can vary. One can model such a network as a graph with different transmission ranges for different nodes. In this paper, we focus on the problem of minimum strongly connected dominating and absorbing sets (MSCDASs) in a strongly connected directed ball graph with different transmission ranges, which is also NP-hard. We design an algorithm considering the construction of a strongly connected dominating and absorbing set (SCDAS), whose size does not exceed \(\left( \left( 319 / 15\right) k^3 + \left( 116 / 5\right) k^2 + \left( 29 / 5\right) k\right)\text{opt}+\left( \left( 29 / 3\right) k^3 + \left( 116 / 5\right) k^2 + \left( 87 / 5\right) k + \left( 13 / 15\right)\right)\), where \(\text{opt}\) is the size of an MCDAS and \(k\) denotes the ratio of \(r_{\max}\) to \(r_{\min}\) in the ad hoc network with transmission range \(\left[ r_{\min} , r_{\max}\right]\). Our simulations show the feasibility of the algorithm proposed in this paper.