Distributed Computation of Connected Dominating Set for Multi-Hop Wireless Networks-Reference-Cited by-同舟云学术

Distributed Computation of Connected Dominating Set for Multi-Hop Wireless Networks

Published:2015 Issue: Volume:63 Page:482-487
ISSN:1877-0509
Container-title:Procedia Computer Science
language:en
Short-container-title:Procedia Computer Science

Author:

Surendran Simi,Vijayan Sreelakshmy

Publisher

Elsevier BV

Subject

General Engineering

Reference18 articles.

1. S. Guha, S. Khuller, Approximation algorithms for connected dominat ing sets, Proceedings of 4th Annual European Symposium on Algorithms, (1996).

2. Woochang Hwang, Young-rae Cho, Aidong Zhang, Murali Ramanathan , Bridging Centrality: Identifying Bridging Nodes In Scale-free Networks, KDD (2006).

3. Lixin Wang, Peng-Jun Wan, and Frances YaoMinimum CDS in Multi hop Wireless Networks with Disparate Communication Ranges, IEEE(2013).

4. Yacine Belhoul a, b, Sad Yahiaouia,b,Hamamache KheddoucicE_cient self-stabilizing algorithms for minimal total k-dominating sets in graphs,(2013).

5. Hongwei (David) Du, Member, Weili Wu, Qiang Ye, Member, Deying Li, Wonjun Lee, , and Xuepeng XuCDS-Based Virtual Backbone Construction with Guaranteed Routing Cost in Wireless Sensor Networks, IEEE, (2013).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Note on Dominating Set Problems;Journal of Communications Technology and Electronics;2021-12

2. A fault-tolerant and distributed capacitated connected dominating set algorithm for wireless sensor networks;Computer Standards & Interfaces;2021-08

3. Centrality Metrics-Based Connected Dominating Sets for Real-World Network Graphs;Strategic Innovations and Interdisciplinary Perspectives in Telecommunications and Networking;2019