A method for constructing connected dominating set for consensus in ad hoc wireless network Online publication date: Fri, 25-Feb-2022
by Qingdong Huang; Yun Zhou; Qing Liu
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 39, No. 3, 2022
Abstract: This paper proposes a concise-connected dominating set (C-CDS) algorithm of constructing connected dominating set (CDS) for ad hoc wireless networks. By introducing the eigenvector centrality value related to topology-information as unique id number of node, this method can reduce the omitted nodes caused by randomness of node numbering, retain the dominant node with high influence and remove more dominating nodes with small influence. In addition, adding and perfecting reduction rules further simplify the CDS after the reduction of original two rules, which can significantly reduce the size of connected dominating set compared with the existing methods at a small computational cost. Finally, we also propose a fast method for consensus which can reach consensus in one round based on CDS, with the final consensus result shared to the entire network. Simulation results verify that there is better performance in generating C-CDS and consensus than the existing algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook