<abstract xmlns="http://www.w3.org/1999/xhtml"><p>The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of the crossed cube (ITCC) is presented. The ITCC is to find a maximal independent set (MIS), which is based on building an induced tree of the crossed cube network, and then to connect the MIS nodes to form a CDS. The priority of an induced tree is determined according to a new parameter, the degree of the node in the square of a graph. This paper presents the proof that the ITCC generates a CDS with a lower approximation ratio. Furthermore, it is proved that the cardinality of the induced trees is a Fibonacci sequence, and an upper bound to the number of the dominating set is established. The simulations show that the algorithm provides the smallest CDS size compared with some other traditional algorithms.</p></abstract>

The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of the crossed cube (ITCC) is presented. The ITCC is to find a maximal independent set (MIS), which is based on building an induced tree of the crossed cube network, and then to connect the MIS nodes to form a CDS. The priority of an induced tree is determined according to a new parameter, the degree of the node in the square of a graph. This paper presents the proof that the ITCC generates a CDS with a lower approximation ratio. Furthermore, it is proved that the cardinality of the induced trees is a Fibonacci sequence, and an upper bound to the number of the dominating set is established. The simulations show that the algorithm provides the smallest CDS size compared with some other traditional algorithms.

An efficient connected dominating set algorithm in WSNs based on the induced tree of the crossed cube

College of Mathematics and Computer Science, Fujian Normal University No. 8, Shangsan Road, Cangshan District, Fuzhou, Fujian, 350007 China

School of Information Science and Engineering, Fujian University of Technology 3th Xueyuan Road, University Town, Minhou, Fuzhou, Fujian, 350108 China

Department of Computer Science, University of Tsukuba 1-1-1 Tennodai, Tsukuba, Ibaraki, 305-8577 Japan

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded...

An efficient connected dominating set algorithm in WSNs based on the induced tree of the crossed cube

Publié en ligne: 25 juin 2015

Pages: 295 - 309

Reçu: 03 janv. 2014

DOI: https://doi.org/10.1515/amcs-2015-0023

© by Jing Zhang

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.