Strongly connected dominating and absorbing set in directed disk graph
by Zhao Zhang; Weili Wu; Lidong Wu; Yanjie Li; Zongqing Chen
International Journal of Sensor Networks (IJSNET), Vol. 19, No. 2, 2015

Abstract: A heterogeneous wireless network can be modelled as a directed disk graph, in which a sensor u can receive signals from sensor v if and only if u is within the transmission range of v. A virtual backbone of such a network is a strongly connected dominating and absorbing set (SCDAS). This paper presents a (2 + ε)-approximation algorithm for the minimum dominating and absorbing set problem (DAS), which, as far as we know, is the first one achieving a constant approximation ratio for DAS without requiring a bounded ratio of maximum transmission range over minimum transmission range. Based on such a DAS, a (4 + 3 ln(2 + ε)opt + ε)-approximation algorithm for SCDAS is presented, where opt is the size of an optimal SCDAS, which improves on the previous approximation ratio (3H(n − 1) − 1), where n is the number of nodes, and H(·) is the Harmonic function.

Online publication date: Tue, 08-Sep-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com