On greedy construction of connected dominating sets in wireless networks-Reference-Cited by-同舟云学术

On greedy construction of connected dominating sets in wireless networks

Published:2005 Issue:8 Volume:5 Page:927-932
ISSN:1530-8669
Container-title:Wireless Communications and Mobile Computing
language:en
Short-container-title:Wirel. Commun. Mob. Comput.

Author:

Li Yingshu,Thai My T.,Wang Feng,Yi Chih-Wei,Wan Peng-Jun,Du Ding-Zhu

Publisher

Wiley

Subject

Electrical and Electronic Engineering,Computer Networks and Communications,Information Systems

Reference20 articles.

1. Distributed heuristics for connected dominating sets in wireless ad hoc networks

2. , . Message-optimal connected dominating sets in mobile ad hoc networks. In Proceedings of the 3rd ACM International Symposium on Mobile ad hoc Networking & Computing, pp. 157-164, Lausanne, Switzerland, June 2002.

3. , . Connected domination in ad hoc wireless networks. In Proceedings of the 6th International Conference on Computer Science and Informatics (CS&I'2002), Durham, NC, USA, March, 2002.

4. , , . Connected domination in ad hoc wireless networks. In Proceedings of the 6th International Conference on Computer Science and Informatics (CS&I'2002), Durham, NC, USA, March, 2002.

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

1. TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs;Sensors;2023-09-12

2. Connected domination in graphs and v-numbers of binomial edge ideals;Collectanea Mathematica;2023-08-26

3. Construction of node- and link-fault-tolerant virtual backbones in wireless networks;The Journal of Supercomputing;2023-03-21

4. Sustainable Maintenance of Connected Dominating Set by Solar Energy Harvesting for IoT Networks;IEEE Transactions on Green Communications and Networking;2022-12

5. A Novel Framework for the Coverage Problem in Battery-Free Wireless Sensor Networks;IEEE Transactions on Mobile Computing;2022-03-01