Clustering wireless ad hoc networks with weakly connected dominating set-Reference-Cited by-同舟云学术

Clustering wireless ad hoc networks with weakly connected dominating set

Published:2007-06 Issue:6 Volume:67 Page:727-737
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Han Bo,Jia Weijia

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference38 articles.

1. Maximal independent set, weakly connected dominating set, and induced spanners for mobile ad hoc networks;Alzoubi;Internat. J. Found. Comput. Sci.,2003

2. The design and simulation of a mobile radio network with distributed control;Baker;IEEE J. Select. Areas Commun.,1984

3. S. Basagni, Distributed clustering for ad hoc networks, in: Proceedings of I-SPAN’1999, June 1999, pp. 310–315.

4. S. Basagni, M. Mastrogiovanni, C. Petrioli, A performance comparison of protocols for clustering and backbone formation in large scale ad hoc network, in: Proceedings of the First IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS’2004), October 2004, pp. 70–79.

5. M. Cardei, X. Cheng, X. Cheng, D.-Z. Du, Connected domination in ad hoc wireless networks, in: Proceedings of the Sixth International Conference on Computer Science and Informatics (CS&I’2002), March 2002.

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

1. A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem;Neural Computing and Applications;2024-04-29

2. A greedy randomized adaptive search procedure (GRASP) for minimum weakly connected dominating set problem;Expert Systems with Applications;2023-04

3. Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number;Discrete Applied Mathematics;2021-12

4. Data-driven Clustering in Ad-hoc Networks based on Community Detection;Adjunct Proceedings of the 2021 ACM International Joint Conference on Pervasive and Ubiquitous Computing and Proceedings of the 2021 ACM International Symposium on Wearable Computers;2021-09-21

5. NP-completeness results for partitioning a graph into total dominating sets;Theoretical Computer Science;2020-05