Subscribe

Issue No.05 - May (2013 vol.12)

pp: 909-916

Lixin Wang , Dept. of Math., Paine Coll., Augusta, GA, USA

Peng-Jun Wan , Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA

Frances Yao , Inst. for Theor. Comput. Sci., Tsinghua Univ., Beijing, Chile

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2012.58

ABSTRACT

Connected dominating set (CDS) has a wide range of applications in multihop wireless networks. The Minimum CDS problem has been studied extensively in multihop wireless networks with uniform communication ranges. However, in practice, the nodes may have different communication ranges either because of the heterogeneity of the nodes, or due to interference mitigation, or due to a chosen range assignment for energy conservation. In this paper, we present a greedy approximation algorithm for computing a Minimum CDS in multihop wireless networks with disparate communications ranges and prove that its approximation ratio is better than the best one known in the literature. Our analysis utilizes a tighter relation between the independence number and the connected domination number.

INDEX TERMS

Wireless networks, Approximation methods, Spread spectrum communication, Approximation algorithms, Upper bound, Mobile computing, Electronic mail, virtual backbone, Connected dominating set, independent set, disk graph, wireless network

CITATION

Lixin Wang, Peng-Jun Wan, Frances Yao, "Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges",

*IEEE Transactions on Mobile Computing*, vol.12, no. 5, pp. 909-916, May 2013, doi:10.1109/TMC.2012.58REFERENCES