Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks

Sensors

Xuemei Sun¹  Yongxin Yang¹  Maode Ma² 

[1] School of Computer Science and Technology, Tianjin Polytechnic University, Tianjin 300387, China;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore;

关键词: ad hoc sensor networks;    maximum independent set (MIS);    minimum connected dominating set (MCDS);    minimum spanning tree;    Steiner tree;   

DOI  :  10.3390/s19081919

来源: DOAJ

【 摘 要 】

To achieve effective communication in ad hoc sensor networks, researchers have been working on finding a minimum connected dominating set (MCDS) as a virtual backbone network in practice. Presently, many approximate algorithms have been proposed to construct MCDS, the best among which is adopting the two-stage idea, that is, to construct a maximum independent set (MIS) firstly and then realize the connectivity through the Steiner tree construction algorithm. For the first stage, this paper proposes an improved collaborative coverage algorithm for solving maximum independent set (IC-MIS), which expands the selection of the dominating point from two-hop neighbor to three-hop neighbor. The coverage efficiency has been improved under the condition of complete coverage. For the second stage, this paper respectively proposes an improved Kruskal–Steiner tree construction algorithm (IK–ST) and a maximum leaf nodes Steiner tree construction algorithm (ML-ST), both of which can make the result closer to the optimal solution. Finally, the simulation results show that the algorithm proposed in this paper is a great improvement over the previous algorithm in optimizing the scale of the connected dominating set (CDS).

【 授权许可】

Unknown